Graph TheoryB. Bollobás The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contniutions, suitably refereed and revised. For many years now, graph theory has been developing at a great pace and in many directions. In order to emphasize the variety of questions and to preserve the freshness of research, the theme of the meeting was not restricted. Consequently, the papers in this volume deal with many aspects of graph theory, including colouring, connectivity, cycles, Ramsey theory, random graphs, flows, simplicial decompositions and directed graphs. A number of other papers are concerned with related areas, including hypergraphs, designs, algorithms, games and social models. This wealth of topics should enhance the attractiveness of the volume. |
Contents
| 1 | |
| 15 | |
Chapter 3 Large graphs with given degree and diameter III | 23 |
Chapter 4 Distinguishing vertices of random graphs | 33 |
Chapter 5 The trail number of a graph | 51 |
Chapter 6 Message graphs | 61 |
Chapter 7 Sets of graph colourings | 65 |
Chapter 8 On Hadwigers number and the stability number | 71 |
Some new aspects and applications | 101 |
Chapter 13 Achievement and avoidance games for graphs | 111 |
Chapter 14 Embedding incomplete latin rectangles | 121 |
Chapter 15 Edgecolouring regular bipartite graphs | 139 |
Chapter 16 Some colouring problems and their complexity | 159 |
Chapter 17 A Hamiltonian game | 171 |
Chapter 18 Finite Ramsey theory and strongly regular graphs | 179 |
Chapter 19 The connectivities of a graph and its complement | 191 |
Chapter 9 A depthfirstsearch characterization of planarity | 75 |
Chapter 10 Graphtheoretical model of social organization | 81 |
Chapter 11 Odd cycles of specified length in nonbipartite graphs | 89 |
Annals of Discrete Mathematics | 203 |