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 K [subscript 4n,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. Edited By E. Billington, S. Oates-williams, And A.p. Street. Includes Bibliographical References. Star gazing in affine planes....Pages 1-33 Orbits, enumeration and colouring....Pages 34-66 Classifying distance-transitive graphs....Pages 67-88 Some new methods in reconstruction theory....Pages 89-114 On the uses of contracted codes....Pages 115-122 When are symmetric graphs characterised by their local properties?....Pages 123-141 Old and new results on perfect coverings....Pages 142-149 The graph of hypergraphic realisations of denumerable multisets of degrees....Pages 150-181 Construction of some irreducible designs....Pages 182-196 Partitions and the sequence counting problem in economic lot scheduling....Pages 197-224 Matroid bases, opposite families and some related algorithms....Pages 225-238 An efficient heuristic for identifying a maximum weight planar subgraph....Pages 239-251 Constructing certain cubic graphs....Pages 252-274 Some decompositions of generalised Catalan numbers....Pages 275-293 A corollary to Perfect's theorem....Pages 294-299 Factoring binary matrices: A weaver's approach....Pages 300-326 A class of natural bijections between catalan families....Pages 327-348 A feasibility study of a search for ovals in a projective plane of order 10....Pages 349-352 An interesting decomposition of k 4n,4n into planar subgraphs....Pages 353-357 Characterizations of different line graphs of graphs....Pages 358-364 Some even composite graphs with stability index greater than one....Pages 365-371 Fault-free rectangles tiled with rectangular polyominoes....Pages 372-377 Some families of partially balanced incomplete block designs....Pages 378-386 Directed coverings and packings of pairs and quadruples....Pages 387-391 Sequential binary arrays II: Further results on the square grid....Pages 392-418 A difference set construction for inversive planes....Pages 419-422 On configurations of bear subplanes of the projective plane over a finite field of square order....Pages 423-443