Abstract
As we have seen, a graph can be represented graphically, that is, a graph can be drawn in the plane, and it is this kind of graphical presentation that helps us intuitively understand many of structural properties of graphs. In many real-world problems, for example, layout of printed circuits, one wish to draw a graph in the plane such that its edges intersect only at their end-vertices, such a graph is called to be planar. A natural and important question is how to decide whether a given graph is planar or not. We will, in this chapter, discuss and answer this problem.
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
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Xu, J. (2003). Plane Graphs and Planar Graphs. In: Theory and Application of Graphs. Network Theory and Applications, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8698-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8698-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4670-8
Online ISBN: 978-1-4419-8698-6
eBook Packages: Springer Book Archive