LEADER 03500nam 22005775 450 001 996466495303316 005 20211005105333.0 010 $a3-540-38792-7 024 7 $a10.1007/BFb0091801 035 $a(CKB)1000000000437919 035 $a(SSID)ssj0000321909 035 $a(PQKBManifestationID)12125869 035 $a(PQKBTitleCode)TC0000321909 035 $a(PQKBWorkID)10280251 035 $a(PQKB)10763831 035 $a(DE-He213)978-3-540-38792-3 035 $a(MiAaPQ)EBC5595544 035 $a(MiAaPQ)EBC6691589 035 $a(Au-PeEL)EBL5595544 035 $a(OCoLC)1076244767 035 $a(Au-PeEL)EBL6691589 035 $a(PPN)155176676 035 $a(EXLCZ)991000000000437919 100 $a20121227d1981 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Mathematics VIII$b[electronic resource] $eProceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980 /$fedited by K. L. McAvaney 205 $a1st ed. 1981. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1981. 215 $a1 online resource (XVI, 360 p.) 225 1 $aLecture Notes in Mathematics,$x0075-8434 ;$v884 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-10883-1 327 $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. 410 0$aLecture Notes in Mathematics,$x0075-8434 ;$v884 606 $aCombinatorics 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aCombinatorics. 615 14$aCombinatorics. 676 $a511.6 702 $aMcAvaney$b K. L$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466495303316 996 $aCombinatorial mathematics VIII$9262535 997 $aUNISA