Abstract
Kuratowski3) has shown that a topologicagraph is planar, i. e. it can be mapped in a 1 — i continuous manner on the surface of a sphere, if and only if it contains neither of two certain graphs within it. The author has shown 4) (I, Theorem 29) that a graph is planar if and only if it has a dual as defined in I. It is the main purpose of the present paper to give a proof of the purely combinatorial theorem (Theorem 12 that a graph has a dual if and only if it contains neither of Kuratowski’s graphs as a subgraph 5). This together with the above mentioned theorem of the author gives a proof (for graphs) of Kuratowski’s theorem which involves little of a point set nature.
Presented to the American Mathematical Society, Dec. 28, 1931.
National Research Fellow.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Birkhäuser Boston
About this chapter
Cite this chapter
Whitney, H. (1992). Planar Graphs. In: Eells, J., Toledo, D. (eds) Hassler Whitney Collected Papers. Contemporary Mathematicians. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2972-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2972-8_9
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7740-8
Online ISBN: 978-1-4612-2972-8
eBook Packages: Springer Book Archive