Linear arboricity for graphs with maximum degree six or seven and edge- multiplicity two
Aït-Djafer, Houria
Ars Comb. 20A, 5-16 (1985).
The diameter of directed graphs associated to plane tessellations
Morillo, P.; Fiol, M. A.; Fàbrega, J.
Ars Comb. 20A, 17-27 (1985).
On the bandwidth of a random graph
Kuang, Y.; McDiarmid, C.
Ars Comb. 20A, 29-36 (1985).
Partition theorems for finite graphs
Sheehan, John
Ars Comb. 20A, 37-42 (1985).
Tight t-designs in projective spaces, and Newton polygons
Bannai, Eiichi; Hoggar, Stuart G.
Ars Comb. 20A, 43-49 (1985).
On the dimension of Steiner triple systems
Zeitler, H.
Ars Comb. 20A, 51-57 (1985).
On balanced arrays with two symbols
Chopra, D. V.
Ars Comb. 20A, 59-63 (1985).
Ringing the changes. II
White, Arthur T.
Ars Comb. 20A, 65-75 (1985).
Enumeration of induced subgraphs of families of trees
Baron, Gerd
Ars Comb. 20A, 77-82 (1985).
Solutions to xr=α in the symmetric group
Bouwer, I. Z.; Chernoff, W. W.
Ars Comb. 20A, 83-88 (1985).
On 2-factors with two components
Hellgren, Torsten B.
Ars Comb. 20A, 89-98 (1985).
Spanning trees and some edge-reconstructible graphs
Caro, Y.; Krasikov, I.; Roditty, Y.
Ars Comb. 20A, 109-118 (1985).
Extremal regular expanders
Gardiner, A.
Ars Comb. 20A, 119-124 (1985).
Connectivity preserving transformations of graphs and the reliability of mobile communication networks
Smith, Derek H.
Ars Comb. 20A, 135-139 (1985).
On constructing codes and the Lee-metric
Astola, Jaakko
Ars Comb. 20A, 141-152 (1985).
A Helly order for a family of (m,n)-convex sets
Tattersall, J. J.
Ars Comb. 20A, 153-162 (1985).
A new family of graphs associated with plane tessellations
Morillo, P.; Fiol, M. A.; Yebra, J. L. A.
Ars Comb. 20A, 163-169 (1985).
Wreath products and genetical enumeration
Lloyd, E. Keith
Ars Comb. 20A, 171-176 (1985).
On the automorphism group of certain cyclic graphs
Salvi, N. Zagaglia
Ars Comb. 20A, 177-191 (1985).
On the existence of incomplete conjugate orthogonal idempotent Latin squares
Bennett, F. E.; Zhu, L.
Ars Comb. 20A, 193-210 (1985).
Dense compound graphs
Gómez, J.; Fiol, M. A.
Ars Comb. 20A, 211-237 (1985).
Snakes and Ladders: A game on a graph
Hartnell, B. L.; Whitehead, C.
Ars Comb. 20A, 239-253 (1985).
Construction of an infinity of pairs of homogeneous tournaments
Tabib, Claudette
Ars Comb. 20A, 255-261 (1985).
On the expected distance from the centroid of a tree
Moon, J. W.
Ars Comb. 20A, 263-276 (1985).
WS-sets and bijective proofs
Lewis, R. P.
Ars Comb. 20A, 277-286 (1985).
