Combinatorial mathematics III : proceedings of the third australian conference held at the University of Queensland, 16-18 May 1974
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Format: | Livre numérique |
| Language: | Anglais |
| Published: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in mathematics
452 |
| Subjects: | |
| Online Access: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • 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, 1975, Berlin, Springer, 1 vol. (IX-233 p.), Lecture notes in mathematics, 3-540-07154-7 • Combinatorial Mathematics III, Texte imprimé, 9783662185605 |
Table of Contents:
- 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.