Planar Graphs: Theory and Algorithms

T. Nishizeki and N. Chiba (Eds.)0444702121, 9780444702128, 9780080867748

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

---

Table of contents :
Content:
Advisory Editors
Page ii

Edited by
Page iii

Copyright page
Page iv

Dedication
Page v

Preface
Pages xi-xii
Takao Nishizeki, Norishige Chiba

Acknowledgments
Page xiii

Chapter 1 Graph Theoretic Foundations
Pages 1-21

Chapter 2 Algorithmic Foundations
Pages 23-32

Chapter 3 Planarity Testing and Embedding
Pages 33-63

Chapter 4 Drawing Planar Graphs
Pages 65-82

Chapter 5 Vertex-Coloring
Pages 83-97

Chapter 6 Edge-Coloring
Pages 99-119

Chapter 7 Independent Vertex Sets
Pages 121-135

Chapter 8 Listing Subgraphs
Pages 137-148

Chapter 9 Planar Separator Theorem
Pages 149-170

Chapter 10 Hamiltonian Cycles
Pages 171-184

Chapter 11 Flows in Planar Graphs
Pages 185-219

References
Pages 221-226

Index
Pages 227-232