Combinatorial Mathematics VIII : Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25 29, 1980

Kaydedildi:
Detaylı Bibliyografya
Müşterek Yazar: Australian conference on combinatorial mathematics :Geelong, Australie
Diğer Yazarlar: McAvaney, Kevin Lawrence, 1946- (Yayın yönetmeni)
Materyal Türü: Livre numérique
Dil:Anglais
Baskı/Yayın Bilgisi: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Seri Bilgileri:Lecture notes in mathematics 884
Konular:
Online Erişim:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Not: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Combinatorial mathematics VIII, proceedings of the eighth Australian conference on combinatorial mathematics held at Deakin University, Geelong, Australia, August 25-29, 1980, edited by Kevin L. McAvaney, 1981, Berlin, Springer-Verlag, 1 vol. (XIV-359 p.), Lecture notes in mathematics, 0-387-10883-1
• Combinatorial Mathematics VIII, Texte imprimé, 9783662176719
İçindekiler:
  • 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.