Abstract
In recent years, a number of papers have appeared which attempt to formulate a combinatorial definition of a map. A systematic development of combinatorial map theory from such a definition is still needed, however, as some theorems which are intuitively obvious topologically are not so clear combinatorially. In this paper, a combinatorial proof is provided for one such theorem.
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
W.T. Tutte, What is a map?, in New Directions in the Theory of Graphs. (Academic Press, New York, 1973.)
E.D. Cooper, Combinatorial map theory, J. Combinatorial Theory B 18 (1975), 73–83.
F. Harary, Graph Theory. (Addison-Wesley, Reading, Mass., 1971, pp.108–112.)
F. Harary, Graph Theory. (Addison-Wesley, Reading, Mass., 1971, pp.112–113.)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Little, C.H.C. (1976). A theorem on planar graphs. In: Casse, L.R.A., Wallis, W.D. (eds) Combinatorial Mathematics IV. Lecture Notes in Mathematics, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097375
Download citation
DOI: https://doi.org/10.1007/BFb0097375
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08053-4
Online ISBN: 978-3-540-37537-1
eBook Packages: Springer Book Archive