Special issue: Mainly the papers of the 21st midwest conference on combinatorics, cryptography and computing (MCCCC), Charleston, SC, USA, October 13–15, 2007. Salehi, Ebrahim (ed.)
The average connectivity of a family of expander graphs
Bahls, Patrick
J. Comb. Math. Comb. Comput. 70, 3-14 (2009).
Group divisible designs with two groups and block size five with fixed block configuration
Hurd, Spencer P.; Mishra, Nutan; Sarvate, Dinesh G.
J. Comb. Math. Comb. Comput. 70, 15-31 (2009).
Combinatorial proof of an Abel-type identity
Kayll, P. Mark; Perkins, David
J. Comb. Math. Comb. Comput. 70, 33-40 (2009).
Strength six orthogonal arrays and their non-existence
Chopra, D. V.; Low, Richard M.; Dios, R.
J. Comb. Math. Comb. Comput. 70, 41-48 (2009).
Neighborhood champions in regular graphs
McSorley, J. P.; Wallis, W. D.
J. Comb. Math. Comb. Comput. 70, 49-56 (2009).
Applications of chromatic polynomials involving Stirling numbers
Mohr, A.; Porter, T. D.
J. Comb. Math. Comb. Comput. 70, 57-64 (2009).
Detour antipodal graphs
Johns, Garry L.; Okamoto, Futaba; Zhang, Ping
J. Comb. Math. Comb. Comput. 70, 65-83 (2009).
On balance index sets of L-products with cycles and complete graphs
Kwong, Harris; Lee, Sin-Min; Lo, Sheng-Ping Bill; Su, Hsin-Hao; Wang, Yung-Chin
J. Comb. Math. Comb. Comput. 70, 85-96 (2009).
Neighborhoods of unbordered words in the n-cube
Cummings, L. J.
J. Comb. Math. Comb. Comput. 70, 97-106 (2009).
Chromatic polynomials of C4×Pn and C5×Pn
Barghi, Amir; Shahmohamad, Hossein
J. Comb. Math. Comb. Comput. 70, 107-110 (2009).
The effect of vertex and edge deletion on the number of sizes of maximal independent sets
Barbosa, Rommel; Hartnell, Bert
J. Comb. Math. Comb. Comput. 70, 111-116 (2009).
A result on chromatic uniqueness of edge-gluing of graphs
Chia, G. L.; Ho, Chee-Kit
J. Comb. Math. Comb. Comput. 70, 117-126 (2009).
Algorithm performance for chessboard separation problems
Chatham, R. Douglas; Doyle, Maureen; Miller, John J.; Rogers, Amber M.; Skaggs, R. Duane; Ward, Jeffrey A.
J. Comb. Math. Comb. Comput. 70, 127-142 (2009).
The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: the case n≡3(mod18)
Ling, Alan C. H.; Dinitz, J. H.
J. Comb. Math. Comb. Comput. 70, 143-147 (2009).
Small bowtie systems: an enumeration
Grannell, M. J.; Griggs, T. S.; LoFaro, G.; Tripodi, A.
J. Comb. Math. Comb. Comput. 70, 149-159 (2009).
On ρ-labeling up to ten vertex disjoint C4x+1
Butzen, E.; El-Zanati, S. I.; Jordon, H.; Modica, A.; Schrishuhn, R.
J. Comb. Math. Comb. Comput. 70, 161-176 (2009).
Perfect domination in rectangular grid graphs
Dejter, Italo J.; Delgado, Abel A.
J. Comb. Math. Comb. Comput. 70, 177-196 (2009).
New weighing matrices of order 2n and weight 2n−5
Kotsireas, Ilias S.; Koukouvinos, Christos
J. Comb. Math. Comb. Comput. 70, 197-205 (2009).
On additively geometric graphs
Arumugam, S.; Germina, K. A.; Anandavally, T. M. K.
J. Comb. Math. Comb. Comput. 70, 207-216 (2009).
The chromatic number of K2(9,4) is 11
Khodkar, Abdollah; Leach, David
J. Comb. Math. Comb. Comput. 70, 217-220 (2009).
Efficient (δ,γ)-pattern matching with don’t cares
Ardilla, Yoan José Pinzón; Christodoulakis, Manolis; Iliopoulos, Costas S.; Mohamed, Manal
J. Comb. Math. Comb. Comput. 70, 221-234 (2009).
On designs constructed by group actions
Darafsheh, M. R.; Ashrafi, A. R.; Khademi, M.
J. Comb. Math. Comb. Comput. 70, 235-245 (2009).
Combinatorial group testing in bipartite graphs
Rodger, C. A.
J. Comb. Math. Comb. Comput. 70, 247-252 (2009).
Minimally k-equitable labeling of butterfly and Benes networks
Rajasingh, Indra; Rajan, Bharati; Arockiaraj, M.; Manuel, Paul
J. Comb. Math. Comb. Comput. 70, 253-260 (2009).
