Combinatorial Mathematics VIII: Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980: Lecture Notes in Mathematics, cartea 884

Some properties of H-designs.- Computation of some number-theoretic coverings.- The search for long paths and cycles in vertex-transitive graphs and digraphs.- On strongly hamiltonian abelian group graphs.- Monochromatic lines in partitions of Zn.- Complete stable marriages and systems of I-M preferences.- The construction of finite projective planes.- A survey of graph generation techniques.- Graphs and two-distance sets.- Finite Ramsey theory is hard.- Further results on coverin integers of the form 1+k2N by primes.- Distributive block structures and their automorphisms.- Connected subgraphs of the graph of multigraphic realisations of a degree sequence.- A construction for a family of sets and its application to matroids.- Regularity and optimality for trees.- Simple and multigraphic realizations of degree sequences.- Critical link identification in a network.- Enumeration of binary phylogenetic trees.- Minimisatin of multiple entry finite automata.- A singular direct product for quadruple systems.- The maximum number of intercalates in a latin square.- Elegant odd rings and non-planar graphs.- On critical sets of edges in graphs.- Further evidence for a conjecture on two-point deleted subgraphs of cartesian products.- Deques, trees and lattice paths.- Graeco-latin and nested row and column designs.- Contrained switchings in graphs.- One-factorisations of wreath products.- Divisible semisymmetric designs.- Graphs and universal algebras.- Universal fabrics.