Abstract
A plane graph is a graph drawn on a plane so that no two edges of the graph (or the curves which represent them ) have a common point except a vertex which is incident on them both. Thus the notion of ‘plane graph’ refers to the graph image rather than to the graph itself. A graph is called planar (embeddable in the plane) if it can be drawn on a plane with no two edges crossing each other. The resultant planar graph image is called an embedding of the graph in the plane or a planar embedding. Figure 2.1 shows two planar graphs, only the second of which is plane.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Feinberg, V., Levin, A., Rabinovich, E. (1997). Graph Planarization. In: VLSI Planarization. Mathematics and Its Applications, vol 399. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5740-7_3
Download citation
DOI: https://doi.org/10.1007/978-94-011-5740-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6421-7
Online ISBN: 978-94-011-5740-7
eBook Packages: Springer Book Archive