The isomorphic factorization of complete bipartite graphs into trees
Shibata, Yukio; Seki, Yasuo
Ars Comb. 33, 3-25 (1992).
Rectangular designs with varying replicates
Sinha, Kishore; Das, A. D.; Kageyama, Sanpei
Ars Comb. 33, 27-29 (1992).
On tricovers of pairs by quintuples: υ≡0 (mod 4)
Assaf, A. M.; Mills, W. H.; Mullin, R. C.
Ars Comb. 33, 31-46 (1992).
Shuffled Lyndon words
Cummings, L. J.; Mays, M. E.
Ars Comb. 33, 47-56 (1992).
Constructing Hadamard matrices with orthogonal pairs
Craigen, R.
Ars Comb. 33, 57-64 (1992).
A characterization of trees in which no edge is essential to the domination number
Hartnell, Bert L.; Rall, Douglas F.
Ars Comb. 33, 65-76 (1992).
Long paths and the cycle space of a graph
Locke, S. C.
Ars Comb. 33, 77-85 (1992).
Enumeration of Hamiltonian cycles in P4×Pn and P5×Pn
Kwong, Y. H. Harris
Ars Comb. 33, 87-96 (1992).
Intersections of S(2,4,υ) designs
Colbourn, Charles J.; Hoffman, Dean G.; Lindner, Charles C.
Ars Comb. 33, 97-111 (1992).
Ovals in the designs W(2m)
Key, J. D.; Mackenzie, K.
Ars Comb. 33, 113-117 (1992).
On edge-coloring graphs
Hoffman, Todd; Mitchem, John; Schmeichel, Edward
Ars Comb. 33, 119-128 (1992).
On the existence of balanced graphs with given egde-toughness and edge- connectivity
Peng, Y. H.; Chen, C. C.; Koh, K. M.
Ars Comb. 33, 129-143 (1992).
On the existence of a double extension of PG(3,2)
Baartmans, Alphonse; Yucas, Joseph
Ars Comb. 33, 145-156 (1992).
A shifting property of some Costas sequences
Moreno, Oscar
Ars Comb. 33, 157-160 (1992).
Partial partitions of vector spaces arising from the construction of byte error control codes
Clark, W. Edwin; Dunning, Larry A.
Ars Comb. 33, 161-177 (1992).
On tricovers of pairs by quintuples: υ≡1(mod4)
Assaf, A. M.; Mills, W. H.; Mullin, R. C.
Ars Comb. 33, 179-191 (1992).
On zero-sum Turán numbers: Stars and cycles
Caro, Yair
Ars Comb. 33, 193-198 (1992).
On the well coveredness of products of graphs
Topp, Jerzy; Volkmann, Lutz
Ars Comb. 33, 199-215 (1992).
On the complexity of coloring areflexive relations
Haddad, Lucien; Rödl, Vojtěch
Ars Comb. 33, 217-225 (1992).
On covering designs with block size 5 and index 4
Assaf, Ahmed M.; Shalaby, N.
Ars Comb. 33, 227-237 (1992).
Covering morphisms between nets
Bagchi, Bhaskar; Bagchi, Sunanda; Mukhopadhyay, A. C.
Ars Comb. 33, 238-244 (1992).
Super-free graphs
Clapham, C. R. J.; Sheehan, J.
Ars Comb. 33, 245-252 (1992).
On the chromatic number of some rational spaces
Zaks, Joseph
Ars Comb. 33, 253-256 (1992).
Domination sequences of graphs
Cockayne, E. J.; Mynhardt, C. M.
Ars Comb. 33, 257-275 (1992).
A construction of balanced ternary designs
Sinha, Kishore
Ars Comb. 33, 276-278 (1992).
Covering complete graphs by cliques
Horák, Peter; Sauer, Norbert
Ars Comb. 33, 279-288 (1992).
On Hamiltonian line graphs
Chen, Zhi-Hong
Ars Comb. 33, 289-294 (1992).
On magic labelings of grid graphs
Bača, Martin
Ars Comb. 33, 295-299 (1992).
A sufficient condition on degree sums of independent triples for Hamiltonian cycles in 1-tough graphs
Faßbender, Bert
Ars Comb. 33, 300-304 (1992).
Indecomposable triple systems without repeated blocks
Hao, Shen
Ars Comb. 33, 305-310 (1992).
Complete k-caps in PG(3,q) with k<(q2+q+4)/2
Faina, G.
Ars Comb. 33, 311-317 (1992).
Corrigendum to “Nestings of directed cycle systems”
Lindner, C. C.; Rodger, C. A.; Stinson, D. R.
Ars Comb. 33, 319 (1992).
On q-divisible hypergraphs
Caro, Yair
Ars Comb. 33, 321-328 (1992).
On a conjecture of Bondy and Fan
Frieze, Alan; McDiarmid, Colin; Reed, Bruce
Ars Comb. 33, 329-336 (1992).
A proper n-dimensional orthogonal design of order 8 on 8 indeterminates
de Launey, Warwick
Ars Comb. 33, 337-342 (1992).
The weight bound and subgeometric packings
Stanton, R. G.
Ars Comb. 33, 343-349 (1992).
