A geometric parallel search problem related to group testing
Füredi, Zoltán; Linial, Nathan
J. Comb. Math. Comb. Comput. 12, 3-6 (1992).
On cocircuit graphs
Farrell, E. J.; Grell, J.
J. Comb. Math. Comb. Comput. 12, 7-15 (1992).
Some necessary existence conditions for certain arrays
Chopra, D. V.
J. Comb. Math. Comb. Comput. 12, 17-21 (1992).
Concavity properties of numbers satisfying the binomial recurrence
Vaughan, Theresa P.; Landman, Bruce; Portier, Frederick
J. Comb. Math. Comb. Comput. 12, 23-32 (1992).
Non-isomorphic extremal graphs without three-cycles or four-cycles
Garnick, David K.; Nieuwejaar, Nils A.
J. Comb. Math. Comb. Comput. 12, 33-56 (1992).
Codes from Hadamard matrices and profiles of Hadamard matrices
Lin, Cantian; Lin, Haiping; Wallis, W. D.; Yucas, J. L.
J. Comb. Math. Comb. Comput. 12, 57-64 (1992).
Generalized quadrangles derived from groups and having s=t+2
Payne, Stanley E.
J. Comb. Math. Comb. Comput. 12, 65-76 (1992).
On Steiner systems S(5,6,48)
Grannell, M. J.; Griggs, T. S.; Mathon, R. A.
J. Comb. Math. Comb. Comput. 12, 77-96 (1992).
On the diameter of nth order degree regular trees
Henning, Michael A.
J. Comb. Math. Comb. Comput. 12, 97-108 (1992).
On edge-gracefulness of 2-regular graphs
Lee, Sin-Min; Lo, Sheng-Ping; Seah, Eric
J. Comb. Math. Comb. Comput. 12, 109-117 (1992).
Possible automorphism groups for an S(3,5,26)
Kramer, Earl S.; Magliveras, Spyros S.; Tran van Trung
J. Comb. Math. Comb. Comput. 12, 119-127 (1992).
The effects of graph modification on edge independence and edge covering numbers
Lawson, Linda M.; Haynes, Teresa W.
J. Comb. Math. Comb. Comput. 12, 129-140 (1992).
Spreads of lines and regular group divisible designs
Rahilly, Alan
J. Comb. Math. Comb. Comput. 12, 141-151 (1992).
Resolvable designs applicable to cryptographic authentication schemes
Martin, K. M.; Seberry, Jennifer; Wild, P. R.
J. Comb. Math. Comb. Comput. 12, 153-160 (1992).
Vertex clique covering numbers of r-regular (r−2)-edge-connected graphs
Caccetta, L.; Purwanto
J. Comb. Math. Comb. Comput. 12, 161-173 (1992).
Enumeration of all simple t-(t+7,t+1,2) designs
Radziszowski, Stanislaw P.
J. Comb. Math. Comb. Comput. 12, 175-178 (1992).
Universal and global irredundancy in graphs
Dunbar, Jean; Laskar, Renu
J. Comb. Math. Comb. Comput. 12, 179-185 (1992).
Bailey’s conjecture holds through 87 except possibly for 64
Anderson, B. A.
J. Comb. Math. Comb. Comput. 12, 187-195 (1992).
Enumeration of minimal tree decompositions of complete graphs
Petrenjuk, A. J.
J. Comb. Math. Comb. Comput. 12, 197-199 (1992).
A brief history of the embedding of partial odd cycle systems
Lindner, C. C.
J. Comb. Math. Comb. Comput. 12, 201-214 (1992).
Toughness of graphs and [a,b]-factors with prescribed properties
Chen, Ciping; Liu, Guizhen
J. Comb. Math. Comb. Comput. 12, 215-221 (1992).
