Graph Theory
Foreword by t. J. A. St.Nash-Williams
Published on 29. January 2001
Book
Paperback/Softback
360 pages
978-0-521-79489-3 (ISBN)
Description
Designed for the non-specialist, this classic text by a world expert is an invaluable reference tool for those interested in a basic understanding of the subject. Exercises, notes and exhaustive references follow each chapter, making it outstanding both as a text and reference for graduate students and researchers in graph theory and its applications. The author approaches the subject with a lively writing style. The reader will delight to discover that the topics in this book are coherently unified and include some of the deepest and most beautiful developments in graph theory.
Reviews / Votes
'This is a classic textbook, written by one of the pioneers and most distinguished contributors to the field, and dealing with many of the central themes of graph theory. The treatment of all these topics is unified by the author's highly individual appraoch: this is not just another textbook in graph theory! This book has much to offer to any reader interested in graph theory. ... providing an excellent preparation for some slightly more specialised topics, such as the theory of planar enumeration and chromatic polynomials of maps.' EMS 'The text contains many of the deeper results, and demands concentration, but this will be rewarded.' MathematikaMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises; 93 Line drawings, unspecified
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 21 mm
Weight
584 gr
ISBN-13
978-0-521-79489-3 (9780521794893)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Content
1. Graphs and subgraphs; 2. Concontractions and the theorem of Menger; 3. 2-Connection; 4. 3-Connection; 5. Reconstruction; 6. Diagraphs and paths; 7. Alternating paths; 8. Algebraic duality; 9. Polynomials associated with graphs; 10. Combinatorial maps; 11. Planarity.