From the reviews: "B?la Bollob?s introductory course on graph theory deserves to be considered as a watershed in the development of this theory as a serious academic subject. ... The book has chapters on electrical networks, flows, connectivity and matchings, extremal problems, colouring, Ramsey theory, random graphs, and graphs and groups. Each chapter starts at a measured and gentle pace. Classical results are proved and new insight is provided, with the examples at the end of each chapter fully supplementing the text... Even so this allows an introduction not only to some of the deeper results but, more vitally, provides outlines of, and firm insights into, their proofs. Thus in an elementary text book, we gain an overall understanding of well-known standard results, and yet at the same time constant hints of, and guidelines into, the higher levels of the subject. It is this aspect of the book which should guarantee it a permanent place in the literature." #Bulletin of the London Mathematical Society#1
Author(s): Béla Bollobás (Eds.)
Series: North-Holland Mathematics Studies 62 / Annals of Discrete Mathematics 13
Publisher: Elsevier Science Ltd
Year: 1982
Language: English
Pages: ii-v, 1-201
Content:
Advisory Editors
Page ii
Edited by
Page iii
Copyright page
Page iv
Foreword
Page v
Béla Bollobás
Characterizations and Classifications of Biconnected Graphs Original Research Article
Pages 1-14
J. Akiyama, K. Ando, H. Mizuno
Line Graphs and their Chromatic Polynomials Original Research Article
Pages 15-21
Ruth A. Bari
Large Graphs with Given Degree and Diameter III Original Research Article
Pages 23-31
J.C. Bermond, C. Delorme, G. Farhi
Distinguishing Vertices of Random Graphs Original Research Article
Pages 33-49
Béla Bollobás
The Trail Number of a Graph Original Research Article
Pages 51-60
Béla Bollobás, Frank Harary
Message Graphs Original Research Article
Pages 61-64
J.H. Conway, M.J.T. Guy
Sets of Graphs Colourings Original Research Article
Pages 65-70
David E. Daykin, Peter Frankl
On Hadwiger's Number and the Stability Number Original Research Article
Pages 71-73
P. Duchet, H. Meyniel
A Depth-First-Search Characterization of Planarity Original Research Article
Pages 75-80
H. De Fraysseix, P. Rosenstiehl
Graph-Theoretical Model of Social Organization Original Research Article
Pages 81-88
Jonathan L. Gross
ODD Cycles of Specified Length in Non-Bipartite Graphs Original Research Article
Pages 89-99
Roland Häggkvist
Simplicial Decompositions: Some New Aspects and Applications Original Research Article
Pages 101-110
R. Halin
Achievement and Avoidance Games for Graphs Original Research Article
Pages 111-119
Frank Harary
Embedding Incomplete Latin Rectangles Original Research Article
Pages 121-138
A.J.W. Hilton
Edge-Colouring Regular Bipartite Graphs Original Research Article
Pages 139-158
A.J.W. Hilton, C.A. Rodger
Some Colouring Problems and their Complexity Original Research Article
Pages 159-170
A.J. Mansfield, D.J.A. Welsh
A Hamiltonian Game Original Research Article
Pages 171-178
Alexis Papaioannou
Finite Ramsey Theory and Strongly Regular Graphs Original Research Article
Pages 179-190
J. Sheehan
The Connectivities of a Graph and its Complement Original Research Article
Pages 191-201
Ralph Tindell
