Abstract
We introduce a conjectured characterisation of planar graphs in terms of the structure of the circuits of a graph, and we confirm that conjecture in one direction.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Charles H. C. Little, A characterisation of planar cubic graphs, submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag
About this paper
Cite this paper
Little, C.H.C. (1975). A conjecture about circuits in planar graphs. In: Street, A.P., Wallis, W.D. (eds) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069555
Download citation
DOI: https://doi.org/10.1007/BFb0069555
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07154-9
Online ISBN: 978-3-540-37482-4
eBook Packages: Springer Book Archive