Hamilton paths in graphs whose vertices are graphs
Balińska, Krystyna T.; Gargano, Michael L.; Quintas, Louis V.; Zwierzyński, Krzysztof T.
J. Comb. Math. Comb. Comput. 56, 3-16 (2006).
Inequivalence of nega-cyclic ±1 matrices
Ang, Russel; Seberry, Jennifer; Wysocki, Tadeusz
J. Comb. Math. Comb. Comput. 56, 17-32 (2006).
Sum coloring on certain classes of graphs
Eyabi, Gilbert; Laskar, Renu
J. Comb. Math. Comb. Comput. 56, 33-46 (2006).
On detectable factorizations of cubic graphs
Escuadro, Henry; Okamoto, Futaba; Zhang, Ping
J. Comb. Math. Comb. Comput. 56, 47-63 (2006).
Totally magic injections of graphs
McSorley, John P.
J. Comb. Math. Comb. Comput. 56, 65-81 (2006).
On the optimality of Belic’s lottery designs
Burger, A. P.; Gründlingh, W. R.; van Vuuren, J. H.
J. Comb. Math. Comb. Comput. 56, 83-100 (2006).
Distributed isomorph-free exhaustive generation of anti-Pasch partial triple systems
Moura, Lucia; Raaphorst, Sebastian
J. Comb. Math. Comb. Comput. 56, 101-121 (2006).
Moore-Greig designs. I
Collins, Jarred T.; Finizio, Norman J.
J. Comb. Math. Comb. Comput. 56, 123-137 (2006).
A tight bound on the cardinalities of maximum alliance-free and minimum alliance-cover sets
Shafique, Khurram H.; Dutton, Ronald D.
J. Comb. Math. Comb. Comput. 56, 139-145 (2006).
Edge-three cordial graphs arising from complete graphs
Bapat, M. V.; Limaye, N. B.
J. Comb. Math. Comb. Comput. 56, 147-169 (2006).
The metamorphosis of λ-fold kite systems into maximum packings of λKn with triangles
Lindner, C. C.; Lo Faro, Giovanni; Tripodi, Antoinette
J. Comb. Math. Comb. Comput. 56, 171-189 (2006).
Skew arcs and Wagner’s [23, 14, 5] code
Davidson, Michelle; Batten, Lynn
J. Comb. Math. Comb. Comput. 56, 191-201 (2006).
An improved bound on the cardinality of the minimality pairwise balanced designs on 18 points with maximum block size 4
Roberts, Ian T.; D’Arcy, Sue; Egan, Judith; Grüttmüller, Martin
J. Comb. Math. Comb. Comput. 56, 203-221 (2006).
