Concerning the existence of triples of pairwise almost orthogonal 10×10 Latin squares
Keedwell, A. D.
Ars Comb. 9, 3-10 (1980).
A correspondence for rooted planar maps
Wormald, Nicholas C.
Ars Comb. 9, 11-28 (1980).
Hyperovals and Howell designs
Anderson, B. A.
Ars Comb. 9, 29-38 (1980).
A special 52×52 Room-type design
Kramer, E. S.; Mesner, D. M.
Ars Comb. 9, 39-42 (1980).
On strongly Hamiltonian complete bipartite graphs
Laufer, P. J.
Ars Comb. 9, 43-46 (1980).
Note on a problem of Erdős and Katona
Pach, Janos
Ars Comb. 9, 47-49 (1980).
On the structure of S-cyclic Steiner quadruple systems
Grannell, M. J.; Griggs, T. S.
Ars Comb. 9, 51-58 (1980).
Boss block designs
Dinitz, J. H.; Stinson, D. R.
Ars Comb. 9, 59-68 (1980).
Combinatorial sleuthing
Bush, K. A.
Ars Comb. 9, 69-75 (1980).
The embedding dimension of a graph
Dewdney, A. K.
Ars Comb. 9, 77-90 (1980).
A probabilistic version of Sperner’s theorem
Baumert, Leonard D.; McEliece, Robert J.; Rodemich, Eugene R.; Rumsey, Howard jun.
Ars Comb. 9, 91-100 (1980).
Coherent Room rectangles from permutation groups
Kramer, Earl S.; Kreher, Donald L.; Magliveras, Spyros S.; Mesner, Dale M.
Ars Comb. 9, 101-111 (1980).
Graphs for which every unilateral orientation is traceable
Fink, John Frederick; Lesniak-Foster, Linda
Ars Comb. 9, 113-118 (1980).
Decomposition of trees into isomorphic subtrees
Caro, Y.; Schonheim, J.
Ars Comb. 9, 119-130 (1980).
Ranks of incidence matrices of (2,3)-coverings
Dehon, Michel
Ars Comb. 9, 131-147 (1980).
Complex weighing matrices and orthogonal designs
Seberry, Jennifer; Whiteman, Albert Leon
Ars Comb. 9, 149-162 (1980).
A 57×57×57 Room-type design
Kramer, Earl S.; Magliveras, Spyros S.
Ars Comb. 9, 163-166 (1980).
On biplanes with 56 points
Denniston, R. H. F.
Ars Comb. 9, 167-179 (1980).
Two regular symmetric families
Bush, K. A.
Ars Comb. 9, 181-189 (1980).
Combinatorial isomorphism problems involving 1-factorizations
Colbourn, Charles J.; Colbourn, Marlene J.
Ars Comb. 9, 191-200 (1980).
Gap-frequency partitions and the Rogers-Selberg identities
Andrews, George E.
Ars Comb. 9, 201-210 (1980).
On 1-factors of cubic bipartite graphs
Brualdi, Richard A.
Ars Comb. 9, 211-219 (1980).
The matching polynomial and its relation to the acyclic polynomial of a graph
Farrell, E. J.
Ars Comb. 9, 221-228 (1980).
On the chromatic number of geometric graphs
Erdős, Paul; Simonovits, M.
Ars Comb. 9, 229-246 (1980).
A Steiner system with a maximal arc
Denniston, R. H. F.
Ars Comb. 9, 247-248 (1980).
An extremal problem in graph theory
Erdős, Paul; Howorka, E.
Ars Comb. 9, 249-251 (1980).
A construction for orthogonal Steiner triple systems
Zhu, L.
Ars Comb. 9, 253-262 (1980).
Resolvable Steiner quadruple systems
Hartman, Alan
Ars Comb. 9, 263-273 (1980).
Perfect graphs with non-negative Euler characteristic
Grinstead, Charles M.
Ars Comb. 9, 275-281 (1980).
Tait’s theorem for graphs with crossing number at most one
Jaeger, François
Ars Comb. 9, 283-287 (1980).
A combinatorial problem in music theory Babbitt’s partition problem. II
Bazelow, Alexander R.; Brickle, Frank
Ars Comb. 9, 289-305 (1980).
Some graph-isomorphism computations
McKay, B. D.; Stanton, R. G.
Ars Comb. 9, 307-313 (1980).
