000 | 02863nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-37482-4 | ||
003 | DE-He213 | ||
005 | 20190213151314.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1975 gw | s |||| 0|eng d | ||
020 |
_a9783540374824 _9978-3-540-37482-4 |
||
024 | 7 |
_a10.1007/BFb0069539 _2doi |
|
050 | 4 | _aQA1-939 | |
072 | 7 |
_aPB _2bicssc |
|
072 | 7 |
_aMAT000000 _2bisacsh |
|
072 | 7 |
_aPB _2thema |
|
082 | 0 | 4 |
_a510 _223 |
245 | 1 | 0 |
_aCombinatorial Mathematics III _h[electronic resource] : _bProceedings of the Third Australian Conference Held at the University of Queensland, 16–18 May, 1974 / _cedited by Anne Penfold Street, Walter Denis Wallis. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1975. |
|
300 |
_aXII, 240 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v452 |
|
505 | 0 | _aA 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. | |
650 | 0 | _aMathematics. | |
650 | 1 | 4 |
_aMathematics, general. _0http://scigraph.springernature.com/things/product-market-codes/M00009 |
700 | 1 |
_aStreet, Anne Penfold. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aWallis, Walter Denis. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662185605 |
776 | 0 | 8 |
_iPrinted edition: _z9783540071549 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v452 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0069539 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c10215 _d10215 |