This text features most of the important theorems and algorithms for planar graphs. Topics include planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multi-commodity flows. Suitable as a textbook, it is also useful for researchers. 1988 edition.
