Abstract
Planarity is one of the classical topics in graph theory, partly due to the celebrated 4-colour theorem which largely fostered the development of graph theory. This theorem will be discussed in the next chapter, whilst this chapter will focus solely on the planarity property. As a blending of combinatorics and topology, there are some topological preliminaries which are necessary, but these will not be discussed too deeply. The central result in this chapter is Kuratowski’s theorem, which characterises planar graphs in terms of forbidden minors. This is a result with deep extensions in graph theory.
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
References
R. Courant, H. Robbins. What Is Mathematics? An Elementary Approach to Ideas and Methods (Oxford University Press, New York, 1979)
R. Diestel. Graph Theory. Graduate Texts in Mathematics, vol 173, 5th edn. (Springer, Berlin, 2018)
B. Mohar, C. Thomassen. Graphs on Surfaces. Johns Hopkins Studies in the Mathematical Sciences (Johns Hopkins University Press, Baltimore, 2001)
W. Schnyder, Planar graphs and poset dimension. Order 5, 323–343 (1989)
C. Thomassen, Kuratowski’s theorem. J. Graph Theory 5, 225–241 (1981)
W.T. Tutte, How to draw a graph. Proc. Lond. Math. Soc. 3, 743–767 (1963)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ball, S., Serra, O. (2024). Planarity. In: A Course in Combinatorics and Graphs. Compact Textbooks in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-55384-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-55384-4_7
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-55383-7
Online ISBN: 978-3-031-55384-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)