This book features most of the important theorems and algorithms related to planar graphs. Eminently suitable as a text, it also is useful for researchers and includes an extensive reference section.
The authors, who have researched planar graphs for many years, have structured the topics in a manner relevant to graph theorists and computer scientists. The first two chapters are introductory and provide the foundations of the graph theoretic notions and algorithmic techniques used throughout the text. Succeeding chapters discuss planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, independent vertex sets, and subgraph listing. The text concludes with explorations of planar separator theorem, Hamiltonian cycles, and single-commodity or multi-commodity flows.