Keywords
- Planar Graph
- Coloring Problem
- Hamiltonian Circuit
- Usual Reduction
- Maximal Subgraph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your 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
S. K. Stein, B-sets and coloring problems, Bull. Amer. Math. Soc., 1970, pp. 304–305.
W. T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc., 82 (1956), pp. 99–116.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1971 Springer-Verlag
About this paper
Cite this paper
Barnette, D.W., Stein, S.K. (1971). On a theorem of tutte, a 4-color theorem and B-sets. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059418
Download citation
DOI: https://doi.org/10.1007/BFb0059418
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05386-6
Online ISBN: 978-3-540-36508-2
eBook Packages: Springer Book Archive
