Abstract
We prove that a graph is non-planar if and only if it contains a strict elegant odd ring.
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.
References
K. Kuratowski, Sur le probleme des courbes gauches en topologie, Fund. Math. 15 (1930) 271–283.
C.H.C. Little, A Conjecture About Circuits In Planar Graphs, Combinatorial Mathematics III, Lecture Notes in Mathematics, Springer, New York 452 (1975), 171–175.
C.H.C. Little, A Theorem On Planar Graphs, Combinatorial Mathematics IV, Lecture Notes in Mathematics, Springer, New York 560 (1976), 136–141.
K. Wagner, Ueber eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570–590.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Holton, D.A., Little, C.H.C. (1981). Elegant odd rings and non-planar graphs. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091823
Download citation
DOI: https://doi.org/10.1007/BFb0091823
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10883-2
Online ISBN: 978-3-540-38792-3
eBook Packages: Springer Book Archive