000 03242nam a22004455i 4500
001 978-3-540-38792-3
003 DE-He213
005 20190213151150.0
007 cr nn 008mamaa
008 121227s1981 gw | s |||| 0|eng d
020 _a9783540387923
_9978-3-540-38792-3
024 7 _a10.1007/BFb0091801
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
072 7 _aPBV
_2thema
082 0 4 _a511.6
_223
245 1 0 _aCombinatorial Mathematics VIII
_h[electronic resource] :
_bProceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25–29, 1980 /
_cedited by Kevin L. McAvaney.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1981.
300 _aXVI, 360 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 ;
_v884
505 0 _aSome properties of H-designs -- Computation of some number-theoretic coverings -- The search for long paths and cycles in vertex-transitive graphs and digraphs -- On strongly hamiltonian abelian group graphs -- Monochromatic lines in partitions of Zn -- Complete stable marriages and systems of I-M preferences -- The construction of finite projective planes -- A survey of graph generation techniques -- Graphs and two-distance sets -- Finite Ramsey theory is hard -- Further results on coverin integers of the form 1+k2N by primes -- Distributive block structures and their automorphisms -- Connected subgraphs of the graph of multigraphic realisations of a degree sequence -- A construction for a family of sets and its application to matroids -- Regularity and optimality for trees -- Simple and multigraphic realizations of degree sequences -- Critical link identification in a network -- Enumeration of binary phylogenetic trees -- Minimisatin of multiple entry finite automata -- A singular direct product for quadruple systems -- The maximum number of intercalates in a latin square -- Elegant odd rings and non-planar graphs -- On critical sets of edges in graphs -- Further evidence for a conjecture on two-point deleted subgraphs of cartesian products -- Deques, trees and lattice paths -- Graeco-latin and nested row and column designs -- Contrained switchings in graphs -- One-factorisations of wreath products -- Divisible semisymmetric designs -- Graphs and universal algebras -- Universal fabrics.
650 0 _aCombinatorics.
650 1 4 _aCombinatorics.
_0http://scigraph.springernature.com/things/product-market-codes/M29010
700 1 _aMcAvaney, Kevin L.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662176719
776 0 8 _iPrinted edition:
_z9783540108832
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v884
856 4 0 _uhttps://doi.org/10.1007/BFb0091801
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c9744
_d9744