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

Author:   K. L. McAvaney
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1981 ed.
Volume:   884
ISBN:  

9783540108832


Pages:   360
Publication Date:   01 October 1981
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $121.44 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

Full Product Details

Author:   K. L. McAvaney
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1981 ed.
Volume:   884
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   1.160kg
ISBN:  

9783540108832


ISBN 10:   3540108831
Pages:   360
Publication Date:   01 October 1981
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List