This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K Appel, W. Haken: Every planar map is four colorable. Part I: discharging, Illinois Journal of Mathematics, 21, (1977), 429–490.
K. Appel, W. Haken: Every planar map is four colorable. Part II: reducibility, Illinois Journal of Mathematics, 21, (1977), 491–567.
D.R. Bean: Effective coloration. Journal of Symbolic Logic, 41, (1976), 469–480.
H.-G. Carstens: Rekursionstheoretische Untersuchungen über Graphen. Habilitationsschrift, Hannover 1975.
F. Harary: Graph Theory. Addison-Wesley, 1969.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Carstens, HG. (1987). A 5-color-extension-theorem. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_155
Download citation
DOI: https://doi.org/10.1007/3-540-18170-9_155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18170-5
Online ISBN: 978-3-540-47795-2
eBook Packages: Springer Book Archive