Check nearby libraries
Buy this book
This book on topological graph theory is written from a purely combinatorial viewpoint. Its aim is to develop a rigorous approach to the foundations of the subject. The book should therefore appeal to graduate students and researchers in topological graph theory. The basic tool used is the idea of a 3-graph, which is a cubic graph endowed with a proper edge coloring in three colors. A special case of a 3-graph, called a gem, provides a model for a cellular embedding of a graph in a surface.
Thus, theorems about embeddings of graphs become theorems about gems. The authors show that many of these theorems generalize to theorems about 3-graphs. Thus, results such as the classification of surfaces, and the theorem that the first Betti number of a surface is the largest number of closed curves that can be drawn on the surface without dividing it into two or more regions, find a general setting in the theory of 3-graphs. The book therefore uses 3-graphs to develop the foundations of topological graph theory and differs in this way from other books on this subject.
Readers should find in its pages a fresh approach to a subject with which they may already have some familiarity.
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Topological graph theoryShowing 3 featured editions. View all 3 editions?
Edition | Availability |
---|---|
1
Foundations of Topological Graph Theory
2012, Springer London, Limited
in English
146122540X 9781461225409
|
zzzz
Libraries near you:
WorldCat
|
2 |
aaaa
Libraries near you:
WorldCat
|
3 |
zzzz
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references (p. [161]-163) and index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?July 18, 2024 | Edited by MARC Bot | import existing book |
May 4, 2023 | Edited by ImportBot | import existing book |
February 7, 2010 | Edited by WorkBot | add more information to works |
December 10, 2009 | Created by WorkBot | add works page |