Graph Theory ( Volume 1 )

Publication series :Volume 1

Author: Bollobás   B.  

Publisher: Elsevier Science‎

Publication year: 1982

E-ISBN: 9780080871738

P-ISBN(Paperback): 9780444864499

P-ISBN(Hardback):  9780444864499

Subject: O157.5 Graph

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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.

Chapter

Front Cover

pp.:  1 – 4

Copyright Page

pp.:  5 – 8

Foreword

pp.:  6 – 10

Table of Contents

pp.:  8 – 6

Chapter 2. Line graphs and their chromatic polynomials

pp.:  24 – 32

Chapter 3. Large graphs with given degree and diameter III

pp.:  32 – 42

Chapter 4. Distinguishing vertices of random graphs

pp.:  42 – 60

Chapter 5. The trail number of a graph

pp.:  60 – 70

Chapter 6. Message graphs

pp.:  70 – 74

Chapter 7. Sets of graph colourings

pp.:  74 – 80

Chapter 8. On Hadwiger’s number and the stability number

pp.:  80 – 84

Chapter 9. A depth-first-search characterization of planarity

pp.:  84 – 90

Chapter 10. Graph-theoretical model of social organization

pp.:  90 – 98

Chapter 11. Odd cycles of specified length in non-bipartite graphs

pp.:  98 – 110

Chapter 12. Simplicial decompositions: Some new aspects and applications

pp.:  110 – 120

Chapter 13. Achievement and avoidance games for graphs

pp.:  120 – 130

Chapter 14. Embedding incomplete latin rectangles

pp.:  130 – 148

Chapter 15. Edge-colouring regular bipartite graphs

pp.:  148 – 168

Chapter 16. Some colouring problems and their complexity

pp.:  168 – 180

Chapter 17. A Hamiltonian game

pp.:  180 – 188

Chapter 18. Finite Ramsey theory and strongly regular graphs

pp.:  188 – 200

Chapter 19. The connectivities of a graph and its complement

pp.:  200 – 212

Annals of Discrete Mathematics

pp.:  212 – 214

The users who browse this book also browse


No browse record.