Combinatorial mathematics III : proceedings of the third Australian conference held at the University of Queensland, 16-18 May, 1974 / edited by Anne Penfold Street and W.D. Wallis.
Material type:
TextSeries: Lecture notes in mathematics (Springer-Verlag) ; 452.Publication details: Berlin ; New York : Springer-Verlag, 1975.Description: 1 online resource (ix, 233 pages) : illustrationsContent type: - text
- computer
- online resource
- 9783540374824
- 3540374825
- 511.6 22
- QA3 .L28 no. 452 QA164
- SI 850
- SK 170
- 05-06
- digitized 2010 HathiTrust Digital Library committed to preserve
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LN Mathematic | Available |
Includes bibliographical references and index.
Use copy Restrictions unspecified star MiAaHDL
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL
http://purl.oclc.org/DLF/benchrepro0212
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
Print version record.
A partial census of trivalent generalized Moore networks -- A note on balanced weighing matrices -- The theory of left-right paths -- The graph of the chromial of a graph -- An alternative to the round robin tournament -- Host-parasite relationships -- Computer assisted generation of difference blocks -- Maximal sets of one-factors -- Comparing the shapes of trees -- An amusing proof in fluctuation theory -- "Combination of events" made easy -- Stability and operations on graphs -- Decomposition of complete graphs into 6-stars and into 10-stars -- Some problems in permutation graphs -- On the matrices used to construct baumert-hall arrays -- A conjecture about circuits in planar graphs -- Stability and cacti -- An algorithm for finding the shortest terminal strings which can be produced from non-terminals in context-free grammars -- Some translation planes with elations which are not translations -- All erections of a combinatorial geometry and their automorphism groups -- Nested designs from sum-free sets -- Non-colourable trivalent graphs.