Combinatorial Mathematics IX: Proceedings of the Ninth Australian Conference on Combinatorial Mathematics Held at the University of Queensland, Brisbane, Australia, August 24-28, 1981

Star gazing in affine planes.- Orbits, enumeration and colouring.- Classifying distance-transitive graphs.- Some new methods in reconstruction theory.- On the uses of contracted codes.- When are symmetric graphs characterised by their local properties?.- Old and new results on perfect coverings.- The graph of hypergraphic realisations of denumerable multisets of degrees.- Construction of some irreducible designs.- Partitions and the sequence counting problem in economic lot scheduling.- Matroid bases, opposite families and some related algorithms.- An efficient heuristic for identifying a maximum weight planar subgraph.- Constructing certain cubic graphs.- Some decompositions of generalised Catalan numbers.- A corollary to Perfect's theorem.- Factoring binary matrices: A weaver's approach.- A class of natural bijections between catalan families.- A feasibility study of a search for ovals in a projective plane of order 10.- An interesting decomposition of k4n,4n into planar subgraphs.- Characterizations of different line graphs of graphs.- Some even composite graphs with stability index greater than one.- Fault-free rectangles tiled with rectangular polyominoes.- Some families of partially balanced incomplete block designs.- Directed coverings and packings of pairs and quadruples.- Sequential binary arrays II: Further results on the square grid.- A difference set construction for inversive planes.- On configurations of bear subplanes of the projective plane over a finite field of square order.