An improved algorithm for determining optimal sums of disjoint sets
Hoskins, W. D.; Lambert, T. D.; Stanton, R. G.
Ars Comb. 17, 5-14 (1984).
Steiner triple systems with small maximal independent sets
de Brandes, Marcia; Rödl, Vojtěch
Ars Comb. 17, 15-19 (1984).
Determining generalized Ramsey numbers is NP-hard
Burr, S. A.
Ars Comb. 17, 21-25 (1984).
Graphs decomposable into paths of length at least three
Weixuan, Li
Ars Comb. 17, 27-32 (1984).
The number of indecomposable designs is finite
Engel, Konrad
Ars Comb. 17, 33-34 (1984).
Huffman’s algorithm and the greedy algorithm
Duke, Roger
Ars Comb. 17, 35-38 (1984).
On the set J(v) for Steiner quadruple systems of order v=7.2n with n≥2
Lo Faro, Giovanni
Ars Comb. 17, 39-47 (1984).
Symmetric bases of additive permutations
Abrham, J.; Kotzig, A.
Ars Comb. 17, 49-68 (1984).
Frames for twofold triple systems
Colbourn, Charles J.; Manson, Karen E.; Wallis, W. D.
Ars Comb. 17, 69-78 (1984).
Circuit designs and latin squares
Keedwell, A. D.
Ars Comb. 17, 79-90 (1984).
Additive permutations of an integer interval: Symmetry and an estimate of their number
Abrham, Jaromir; Kotzig, Anton
Ars Comb. 17, 91-104 (1984).
Higher dimensional ovals and dual translation planes
Wild, Peter
Ars Comb. 17, 105-112 (1984).
On certain regular graphs of girth six
O’Keefe, M.; Wong, P. K.
Ars Comb. 17, 113-116 (1984).
Some improved results concerning the Cordes problem
Stinson, D. R.; van Rees, G. H. J.
Ars Comb. 17, 117-128 (1984).
Cyclic generation of orthogonal latin squares
Franklin, M. F.
Ars Comb. 17, 129-139 (1984).
Triples of almost orthogonal 10×10 Latin squares useful in experimental design
Franklin, M. F.
Ars Comb. 17, 141-146 (1984).
Products and path number I: The cartesian sum
Peroche, B.
Ars Comb. 17, 147-166 (1984).
On the Ramsey number for stars and a complete graph
Jacobson, Michael S.
Ars Comb. 17, 167-172 (1984).
On large sets of disjoint quadruple systems
Teirlinck, Luc
Ars Comb. 17, 173-176 (1984).
The compound twillins: Reflection at an element
Hoskins, J. A.; Stanton, R. G.; Street, A. P.
Ars Comb. 17, 177-190 (1984).
The t-designs using M21≃PSL3(4) on 21 points.
Kramer, Earl S.
Ars Comb. 17, 191-208 (1984).
The binary code of the (191,20,2) biplane
Dawson, E.
Ars Comb. 17, 209-223 (1984).
A characterization theorem for the generalized quadrangle T∗2(O) of order (s,s+2)
de Soete, M.; Thas, J. A.
Ars Comb. 17, 225-242 (1984).
Equally likely fixed length paths in graphs
DeTemple, Duane; Robertson, Jack
Ars Comb. 17, 243-254 (1984).
