Mainly the papers of the 18th midwest conference on combinatorics, cryptography, and computing, MCCCC, Rochester, NY, USA, October 2004 Shahmohamad, Hossein
Recurrences for tri-restricted numbers
Choi, Ji Young; Smith, Jonathan D. H.
J. Comb. Math. Comb. Comput. 58, 3-11 (2006).
Computing the Folkman number Fv(2,2,3;4)
Coles, Jonathan; Radziszowski, Stanisław P.
J. Comb. Math. Comb. Comput. 58, 13-22 (2006).
On the complexity of finding optimal global alliances
Cami, Aurel; Balakrishnan, Hemant; Deo, Narsingh; Dutton, Ronald D.
J. Comb. Math. Comb. Comput. 58, 23-31 (2006).
Investigations on the existence of some balanced arrays with two symbols
Dios, R.; Chopra, D. V.
J. Comb. Math. Comb. Comput. 58, 33-39 (2006).
Matchings defined by local conditions
Bonato, Anthony; Costea, Alexandru
J. Comb. Math. Comb. Comput. 58, 41-53 (2006).
Quasigroups and approximate symmetry
Smith, Jonathan D. H.
J. Comb. Math. Comb. Comput. 58, 55-64 (2006).
Some coefficients of the flow polynomial of Kn
Shahmohamad, Hossein
J. Comb. Math. Comb. Comput. 58, 65-68 (2006).
LMAS: the key to enumerating 2-spheres over the edit metric
Lenarz, Jessie
J. Comb. Math. Comb. Comput. 58, 69-86 (2006).
A family of circular systematic comma-free codes
Cummings, L. J.
J. Comb. Math. Comb. Comput. 58, 87-96 (2006).
A note on the Ramsey numbers R(C4,Bn)
Tse, Kung-Kuen
J. Comb. Math. Comb. Comput. 58, 97-100 (2006).
Superproducts, hyperidentities, and algebraic structures of logic programming
Movsisyan, Yu. M.; Romanowska, A. B.; Smith, J. D. H.
J. Comb. Math. Comb. Comput. 58, 101-111 (2006).
Pair-resolvability and tight embeddings for path designs
Hurd, Spencer P.
J. Comb. Math. Comb. Comput. 58, 113-127 (2006).
Group magicness of complete N-partite graphs
Shiu, W. C.; Low, Richard M.
J. Comb. Math. Comb. Comput. 58, 129-134 (2006).
On Q(a)P(b)-super edge-graceful graphs
Chopra, Dharam; Lee, Sin-Min
J. Comb. Math. Comb. Comput. 58, 135-152 (2006).
Loop transversal codes for error detection
Aydinyan, Ruben; Smith, Jonathan D. H.
J. Comb. Math. Comb. Comput. 58, 153-159 (2006).
A new bound for difference systems of sets
Wang, Hao
J. Comb. Math. Comb. Comput. 58, 161-167 (2006).
Slice algorithms for counting in U-dimensional space
Mulik, Jaiwant; Pathak, Jawahar
J. Comb. Math. Comb. Comput. 58, 169-188 (2006).
A note on the total domination number of a tree
Chellali, Mustapha; Haynes, Teresa W.
J. Comb. Math. Comb. Comput. 58, 189-193 (2006).
The basis number of the strong product of trees and cycles with some graphs
Jaradat, M. M. M.
J. Comb. Math. Comb. Comput. 58, 195-209 (2006).
Pair covering designs with block size 5 with higher index – the case of v even
Bluskov, Iliya; Greig, Malcolm
J. Comb. Math. Comb. Comput. 58, 211-222 (2006).




