Skip to main content
SpringerLink
Log in

Combinatorial Mathematics VIII

Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. Kevin L. McAvaney
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Mathematics (LNM, volume 884)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (31 papers)

  1. Front Matter

    Pages N2-XIV
    Download chapter PDF

  2. Some properties of H-designs

    • R. G. Stanton, R. C. Mullin
    Pages 1-7

  3. Computation of some number-theoretic coverings

    • R. G. Stanton, H. C. Williams
    Pages 8-13

  4. The search for long paths and cycles in vertex-transitive graphs and digraphs

    • Brian Alspach
    Pages 14-22

  5. On strongly hamiltonian abelian group graphs

    • C. C. Chen, N. F. Quimpo
    Pages 23-34

  6. Monochromatic lines in partitions of Zn

    • R. L. Graham, Wen-Ching Winnie Li, J. L. Paul
    Pages 35-48

  7. Complete stable marriages and systems of I-M preferences

    • J. S. Hwang
    Pages 49-63

  8. The construction of finite projective planes

    • Peter Lorimer
    Pages 64-76

  9. A survey of graph generation techniques

    • Ronald C. Read
    Pages 77-89

  10. Graphs and two-distance sets

    • J. J. Seidel
    Pages 90-98

  11. Finite Ramsey theory is hard

    • John Sheehan
    Pages 99-106

  12. Further results on coverin integers of the form 1+k2N by primes

    • R. G. Stanton
    Pages 107-114

  13. Distributive block structures and their automorphisms

    • R. A. Bailey
    Pages 115-124

  14. Connected subgraphs of the graph of multigraphic realisations of a degree sequence

    • David Billington
    Pages 125-135

  15. A construction for a family of sets and its application to matroids

    • J. E. Dawson
    Pages 136-147

  16. Regularity and optimality for trees

    • Peter Eades
    Pages 148-154

  17. Simple and multigraphic realizations of degree sequences

    • R. B. Eggleton, D. A. Holton
    Pages 155-172

  18. Critical link identification in a network

    • L. R. Foulds
    Pages 173-186

  19. Enumeration of binary phylogenetic trees

    • L. R. Foulds, R. W. Robinson
    Pages 187-202

  20. Minimisatin of multiple entry finite automata

    • W. Haebich, J-L. Lassez
    Pages 203-210
Back to top

Bibliographic Information

  • Book Title: Combinatorial Mathematics VIII

  • Book Subtitle: Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980

  • Editors: Kevin L. McAvaney

  • Series Title: Lecture Notes in Mathematics

  • DOI: https://doi.org/10.1007/BFb0091801

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10883-2Published: 01 October 1981

  • eBook ISBN: 978-3-540-38792-3Published: 14 November 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: XVI, 360

  • Topics: Combinatorics

Publish with us

Policies and ethics

Back to top

Search

Navigation