Combinatorial Mathematics III
Combinatorial Mathematics III Proceedings of the Third Australian Conference Held at the University of Queensland, 16–18 May, 1974 / [electronic resource] :
edited by Anne Penfold Street, Walter Denis Wallis.
- XII, 240 p. online resource.
- Lecture Notes in Mathematics, 452 0075-8434 ; .
- Lecture Notes in Mathematics, 452 .
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.
9783540374824
10.1007/BFb0069539 doi
Mathematics.
Mathematics, general.
QA1-939
510
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.
9783540374824
10.1007/BFb0069539 doi
Mathematics.
Mathematics, general.
QA1-939
510