However, the main source of inspiration for planar graphs was the Four Color Conjecture (now Theorem; cf. Chapter 8) that the vertices of any planar graph can be colored with four colors in such a way ...

As a basis of dealing with various constraints arising in IC layout problems we present efficient algorithms for planar embedding of graphs with constraints on vertices in placing them on face ...

The problem of obtaining a planar embedding of a biconnected planar graph is discussed. The approach is based on the planarity testing algorithm of A. Lemple, et al. (1966) and its implementation ...

To reduce a configuration, we remove the 2 or 4 vertices, along with the edges of the path or K4-subdivision. The resulting "reduced" graph is made up of connected components: the ones isomorphic to ...