Planar Graphs
Theory and Algorithms
Published on 11. June 2008
Book
Paperback/Softback
232 pages
978-0-486-46671-2 (ISBN)
Description
This text features most of the important theorems and algorithms for planar graphs. Suitable as a textbook, it is also useful for researchers and includes an extensive reference section. 1988 edition.
More details
Series
Language
English
Place of publication
New York
United States
Product notice
Paperback (trade)
Unsewn / adhesive bound
Illustrations
Illustrations
Dimensions
Height: 216 mm
Width: 138 mm
Thickness: 13 mm
Weight
245 gr
ISBN-13
978-0-486-46671-2 (9780486466712)
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
Content
Acknowledgments
Preface
1. Graph Theoretic Foundations
2. Algorithmic Foundations
3. Planarity Testing and Embedding
4. Drawing Planar Graphs
5. Vertex-Coloring
6. Edge-Coloring
7. Independent Vertex Sets
8. Listing Subgraphs
9. Planar Separator Theorem
10. Hamiltonian Cycles
11. Flows in Planar Graphs
References
Index