Planar Graphs: Theory and Algorithms 0444702121, 9780444702128, 9780080867748

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together w

358 109 2MB

English Pages ii-xiii, 1-232 [244] Year 1988

Report DMCA / Copyright

DOWNLOAD DJVU FILE

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

Planar Graphs: Theory and Algorithms
 0444702121, 9780444702128, 9780080867748

  • 0 0 0
  • Like this paper and download? You can publish your own PDF file online for free in a few minutes! Sign Up
Recommend Papers