Abstract
The two diagrams in Figure 8.1 represent the same graph, a K 4 with vertices a, b, c and d. As diagrams they are quite different: in the left-hand version, the edges ac and bd cross; in the right-hand version there are no crossings. We shall refer to the two diagrams as different representations of the graph in the plane. The crossing number of a representation is the number of different pairs of edges that cross; the crossing number v(G) of a graph G is the minimum number of crossings in any representation of G. A representation is called planar if it contains no crossings, and a planar graph is a graph that has a planar representation. In other words, a planar graph G is one for which v(G) = 0. Figure 8.1 shows that v(K 4) = 0.
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
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wallis, W.D. (2000). Planarity. In: A Beginner’s Guide to Graph Theory. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-3134-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3134-7_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-3136-1
Online ISBN: 978-1-4757-3134-7
eBook Packages: Springer Book Archive