On isomorphic graph factoring
Exoo, Geoffrey
J. Comb. Math. Comb. Comput. 9, 3-10 (1991).
The embeddings of S3(2,4,v)
Wei, Ruizhong
J. Comb. Math. Comb. Comput. 9, 11-32 (1991).
The maximum edge-weighted clique problem in complete multipartite graphs
Cameron, Kathie
J. Comb. Math. Comb. Comput. 9, 33-37 (1991).
Hyperovals in the translation planes of order 16
Cherowitzo, William E.
J. Comb. Math. Comb. Comput. 9, 39-55 (1991).
Changing and unchanging the domination number of a graph
Carrington, Julie; Harary, Frank; Haynes, Teresa W.
J. Comb. Math. Comb. Comput. 9, 57-63 (1991).
Finding longest cycles in inner-triangulated graphs
Cimikowski, Robert J.
J. Comb. Math. Comb. Comput. 9, 65-77 (1991).
Supereulerian graphs and the Petersen graph
Chen, Zhi-Hong
J. Comb. Math. Comb. Comput. 9, 79-89 (1991).
Finding the best edge-packing for two-terminal reliability is NP-hard
Raman, Venkatesh
J. Comb. Math. Comb. Comput. 9, 91-96 (1991).
Some constructions of pairwise orthogonal diagonal Latin squares
Du, B.
J. Comb. Math. Comb. Comput. 9, 97-106 (1991).
Matching, rook and chromatic polynomials and chromatically vector equivalent graphs
Farrell, E. J.; Whitehead, Earl Glen jun.
J. Comb. Math. Comb. Comput. 9, 107-118 (1991).
A class of arbitrarily graceful planar bipartite graphs
Lee, Sin-Min; Tan, Sie-Keng
J. Comb. Math. Comb. Comput. 9, 119-127 (1991).
Doubly nested triple systems and nested B[4,3λ;v]
Wang, Jinhua; Zhu, Lie
J. Comb. Math. Comb. Comput. 9, 129-140 (1991).
On the edge-graceful (n,kn)-multigraphs conjecture
Ho, Yong-Song; Lee, Sin-Min; Seah, Eric
J. Comb. Math. Comb. Comput. 9, 141-147 (1991).
Some interesting sextuple coverings
Stanton, R. G.
J. Comb. Math. Comb. Comput. 9, 149-153 (1991).
The complexity of clustering in planar graphs
Keil, J. Mark; Brecht, Timothy B.
J. Comb. Math. Comb. Comput. 9, 155-159 (1991).
A simple construction for orthogonal Latin rectangles
Mullen, Gary L.; Shiue, Jau-Shyong
J. Comb. Math. Comb. Comput. 9, 161-166 (1991).
Maximally nonhamiltonian graphs
Horak, P.
J. Comb. Math. Comb. Comput. 9, 167-173 (1991).
A note on the amida number of a regular graph
Alspach, Brian; Wang, Zhijian
J. Comb. Math. Comb. Comput. 9, 175-178 (1991).
Uniform generation of random Latin rectangles
McKay, Brendan D.; Wormald, Nicholas C.
J. Comb. Math. Comb. Comput. 9, 179-186 (1991).
A linear model of a learning scheme
Wallis, W. D.; Hu, Chia-Lun J.
J. Comb. Math. Comb. Comput. 9, 187-190 (1991).
The integrity of the cube is small
Beineke, Lowell W.; Goddard, Wayne; Hamburger, Peter; Kleitman, Daniel J.; Lipman, Marc J.; Pippert, Raymond E.
J. Comb. Math. Comb. Comput. 9, 191-193 (1991).
The disjoint 1-factors of (d,d+1)-graphs
Cheng, Zhao
J. Comb. Math. Comb. Comput. 9, 195-198 (1991).
A construction of rectangular designs
Sinha, Kishore
J. Comb. Math. Comb. Comput. 9, 199-200 (1991).
Cycle covers in graphs without subdivisions of K4
Lai, Hong-Jian; Lai, Hongyuan
J. Comb. Math. Comb. Comput. 9, 201-207 (1991).
On affine and projective failed designs
Sane, Sharad S.
J. Comb. Math. Comb. Comput. 9, 209-219 (1991).
