03500nam 22005775 450 99646649530331620211005105333.03-540-38792-710.1007/BFb0091801(CKB)1000000000437919(SSID)ssj0000321909(PQKBManifestationID)12125869(PQKBTitleCode)TC0000321909(PQKBWorkID)10280251(PQKB)10763831(DE-He213)978-3-540-38792-3(MiAaPQ)EBC5595544(MiAaPQ)EBC6691589(Au-PeEL)EBL5595544(OCoLC)1076244767(Au-PeEL)EBL6691589(PPN)155176676(EXLCZ)99100000000043791920121227d1981 u| 0engurnn|008mamaatxtccrCombinatorial Mathematics VIII[electronic resource] Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980 /edited by K. L. McAvaney1st ed. 1981.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1981.1 online resource (XVI, 360 p.) Lecture Notes in Mathematics,0075-8434 ;884Bibliographic Level Mode of Issuance: Monograph3-540-10883-1 Some 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.Lecture Notes in Mathematics,0075-8434 ;884CombinatoricsCombinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Combinatorics.Combinatorics.511.6McAvaney K. Ledthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996466495303316Combinatorial mathematics VIII262535UNISA