Special issue: Mainly the papers presented at the 20th midwest conference on combinatorics, cryptography, and computing, MCCCC, Wichita, KS, USA, October 2006. Chopra, Dharam (ed.)
On balancedness of some graph constructions
Kim, Suh-Ryung; Lee, Sin-Min; Ng, Ho Kuen
J. Comb. Math. Comb. Comput. 66, 3-16 (2008).
A note on non-regular planar graphs
Mishra, Nutan; Sarvate, Dinesh G.
J. Comb. Math. Comb. Comput. 66, 17-31 (2008).
Those amazing Desargues configurations
Bruen, Aiden A.; McQuillan, James M.
J. Comb. Math. Comb. Comput. 66, 33-41 (2008).
On friendly index sets of generalized books
Kwong, Harris; Lee, Sin-Min
J. Comb. Math. Comb. Comput. 66, 43-58 (2008).
Some new results on balanced arrays of strength five
Chopra, D. V.; Bsharat, M.; Mehta, Gobind P.
J. Comb. Math. Comb. Comput. 66, 59-64 (2008).
Distance two vertex-magic graphs
Salehi, Ebrahim
J. Comb. Math. Comb. Comput. 66, 65-77 (2008).
A lower bound of the l-edge-connectivity and optimal graphs
Zhang, Lili; Hennayake, Kamal; Lai, Hong-Jian; Shao, Yehong
J. Comb. Math. Comb. Comput. 66, 79-95 (2008).
Graceful labelings of directed graphs
Marr, Alison M.
J. Comb. Math. Comb. Comput. 66, 97-103 (2008).
Integer-magic spectra of trees of diameter five
Salehi, Ebrahim; Bennett, Patrick
J. Comb. Math. Comb. Comput. 66, 105-111 (2008).
On balance index sets of one-point unions of graphs
Kwong, Harris; Lee, Sin-Min; Sarvate, Dinesh G.
J. Comb. Math. Comb. Comput. 66, 113-127 (2008).
Orthogonal double covers of complete graphs by lobsters of diameter 5
Froncek, Dalibor
J. Comb. Math. Comb. Comput. 66, 129-134 (2008).
On the balance index sets of graphs
Lee, Sin-Min; Ng, Ho Kuen
J. Comb. Math. Comb. Comput. 66, 135-150 (2008).
On the security of Stickel’s key exchange scheme
Sramka, Michal
J. Comb. Math. Comb. Comput. 66, 151-159 (2008).
Global alliance partition in trees
Eroh, Linda; Gera, Ralucca
J. Comb. Math. Comb. Comput. 66, 161-169 (2008).
The edge-graceful spectra of connected bicyclic graphs without pendant
Shiu, W. C.; Ling, M. H.; Low, Richard M.
J. Comb. Math. Comb. Comput. 66, 171-185 (2008).
Judgment aggregation and the greedy algorithm
Earles, Christopher M.
J. Comb. Math. Comb. Comput. 66, 187-194 (2008).
On the edge-graceful spectra of the cylinder graphs. I
Lee, Sin-Min; Levesque, Claude; Lo, Sheng-Ping Bill; Schaffer, Karl
J. Comb. Math. Comb. Comput. 66, 195-214 (2008).
Z-cyclic whist tournaments for q2 players
Jones, John W.; Leonard, Philip A.
J. Comb. Math. Comb. Comput. 66, 215-223 (2008).
A complete characterization of balanced graphs
Kong, Man C.; Lee, Sin-Min; Seah, Eric; Tang, Alfred S.
J. Comb. Math. Comb. Comput. 66, 225-236 (2008).
Directed covering with block size 5 and v and λ odd
AbuGhneim, Omar A.; Al-Halees, Hasan A.; Assaf, Ahmed M.
J. Comb. Math. Comb. Comput. 66, 237-255 (2008).
Powers of directed Hamiltonian paths as feedback arc sets
Narayan, Darren A.
J. Comb. Math. Comb. Comput. 66, 257-272 (2008).
Global domination in planar graphs
Enciso, Rosa I.; Dutton, Ronald D.
J. Comb. Math. Comb. Comput. 66, 273-278 (2008).
Integer programming for covered codes
Lang, W.; Quistorff, J.; Schneider, E.
J. Comb. Math. Comb. Comput. 66, 279-288 (2008).
The combined use of a genetic algorithm and the hill-climbing algorithm to find difference triangle sets
Koubi, Sharon; Shalaby, Nabil
J. Comb. Math. Comb. Comput. 66, 289-296 (2008).
