UID:
almahu_9947367921402882
Format:
1 online resource (305 p.)
ISBN:
1-281-77761-7
,
9786611777616
,
0-08-086766-9
Series Statement:
Annals of discrete mathematics ; 3
Content:
Advances in graph theory
Note:
Consists chiefly of papers presented at the Cambridge Combinatorial Conference held at Trinity College, May 12-14, 1977 under the auspices of the Dept. of Pure Mathematics and Mathematical Statistics.
,
Front Cover; Annals of Discrete Mathematics; Copyright Page; CONTENTS; Foreword; Chapter 1. Linear separation of dominating sets in graphs; Chapter 2. Regularisable graphs; Chapter 3. Hamiltonian decompositions of graphs, directed graphs and hypergraphs; Chapter 4. Extrernal graphs without large forbidden subgraphs; Chapter 5. Hamiltonian cycles in regular graphs; Chapter 6. The chromatic index of the graph of the assignment polytope; Chapter 7. Loopy games; Chapter 8. Hamilton circuits and long circuits; Chapter 9. Simplicial decompositions of infinite graphs
,
Chapter 10. Combinatorial completionsChapter 11. A class of regularisable graphs; Chapter 12. On maximal circuits in finite graphs; Chapter 13. A reduction method for edge-connectivity in graphs; Chapter 14. Another criterion for marriage in denumerable societies; Chapter 15. Selective graphs and hypergraphs; Chapter 16. Monochromatic paths in graphs; Chapter 17. On the principal edge tripartition of a graph; Chapter 18. Percolation probabilities on the square lattice; Chapter 19. On Tutte's dichromate polynomial; Chapter 20. Hamiltonian cycles and uniquely edge colourable graphs
,
Chapter 21. Hamiltonian paths in squares of infinite locally finite blocksChapter 22. An investigation of colour-critical graphs with complements of low connectivity; Chapter 23. The subgraph problem
,
English
Additional Edition:
ISBN 0-7204-0843-1
Language:
English
