Advertisement

A 5-color-extension-theorem

  • Hans-Georg Carstens
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K Appel, W. Haken: Every planar map is four colorable. Part I: discharging, Illinois Journal of Mathematics, 21, (1977), 429–490.Google Scholar
  2. [2]
    K. Appel, W. Haken: Every planar map is four colorable. Part II: reducibility, Illinois Journal of Mathematics, 21, (1977), 491–567.Google Scholar
  3. [3]
    D.R. Bean: Effective coloration. Journal of Symbolic Logic, 41, (1976), 469–480.Google Scholar
  4. [4]
    H.-G. Carstens: Rekursionstheoretische Untersuchungen über Graphen. Habilitationsschrift, Hannover 1975.Google Scholar
  5. [5]
    F. Harary: Graph Theory. Addison-Wesley, 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Hans-Georg Carstens
    • 1
  1. 1.Fakultät für MathematikUniversität Bielefeld, UniversitätsstraßeBielefeld 1Bundesrepublik Deutschland

Personalised recommendations