On the set edge-reconstruction conjecture
Andersen, Lars Døvling; Ding, Songkang; Vestergaard, Preben Dahl
J. Comb. Math. Comb. Comput. 20, 3-9 (1996).
The greatest common divisor index of a graph
Chartrand, Gary; Saba, Farrokh; Goddard, Wayne; Mynhardt, Christina M.
J. Comb. Math. Comb. Comput. 20, 11-26 (1996).
Further results on the multiplier conjecture for the case n=2n1. I
Qiu, Weisheng
J. Comb. Math. Comb. Comput. 20, 27-31 (1996).
Intersections of triple systems: Small orders
Ajoodani-Namini, S.; Khosrovshahi, G. B.; Shokoufandeh, A.
J. Comb. Math. Comb. Comput. 20, 33-52 (1996).
All parity realizable trees
Amin, A. T.; Slater, P. J.
J. Comb. Math. Comb. Comput. 20, 53-63 (1996).
On (n−2)-extendable graphs. II
Ananchuen, N.; Caccetta, L.
J. Comb. Math. Comb. Comput. 20, 65-80 (1996).
Borders of Fibonacci strings
Cummings, L. J.; Moore, D.; Karhumäki, J.
J. Comb. Math. Comb. Comput. 20, 81-87 (1996).
Counting the subgroups of an infinite group
Grady, Michael
J. Comb. Math. Comb. Comput. 20, 89-96 (1996).
Graphs of diameter two without small cycles
Lu, Taojun
J. Comb. Math. Comb. Comput. 20, 97-109 (1996).
Connectivity of Cayley graphs: A special family
Morris, Joy
J. Comb. Math. Comb. Comput. 20, 111-120 (1996).
Construction of orthogonal group divisible designs
Zhang, Xuebin
J. Comb. Math. Comb. Comput. 20, 121-128 (1996).
A short proof of the non-existence of certain cryptographic functions
Gopalakrishnan, K.; Stinson, D. R.
J. Comb. Math. Comb. Comput. 20, 129-137 (1996).
On the strong circuit uniqueness and its application to the circuit characterization of graphs
Farrell, E. J.; Guo, J. M.; Guo, Z. Y.
J. Comb. Math. Comb. Comput. 20, 139-154 (1996).
A local Ore-type condition for graphs of diameter two to be Hamiltonian
Saito, Akira
J. Comb. Math. Comb. Comput. 20, 155-159 (1996).
On perfect dominating sets in hypercubes and their complements
Borges, Joaquim; Dejter, Italo J.
J. Comb. Math. Comb. Comput. 20, 161-173 (1996).
Snake-in-the-box codes for dimension 7
Kochut, Krys J.
J. Comb. Math. Comb. Comput. 20, 175-185 (1996).
On locally semi-complete digraphs
Zhang, Cun-Quan; Zhao, Cheng
J. Comb. Math. Comb. Comput. 20, 186-192 (1996).
Bounds on an independent distance domination parameter
Gimbel, John; Henning, Michael A.
J. Comb. Math. Comb. Comput. 20, 193-205 (1996).
Vertex splitting, parity subgraphs and circuit covers
Zhang, Cun-Quan
J. Comb. Math. Comb. Comput. 20, 206-216 (1996).
On finite bases for some PBD-closed sets
Du, B.
J. Comb. Math. Comb. Comput. 20, 217-224 (1996).
Intersections of 2-(v,4,1) directed designs
Mahmoodian, E. S.; Soltankhah, Nasrin
J. Comb. Math. Comb. Comput. 20, 225-236 (1996).
Computing the kernel of a nonlinear code
LeVan, Mike; Phelps, Kevin T.
J. Comb. Math. Comb. Comput. 20, 237-241 (1996).
A note on the strong 2-cover conjecture for graphs without K5 minors
Lai, Hong-Jian; Lai, Hongyuan
J. Comb. Math. Comb. Comput. 20, 242-244 (1996).
Cycle covers of planar 3-connected graphs
Barnette, D. W.
J. Comb. Math. Comb. Comput. 20, 245-253 (1996).
