The Four-Color Theorem (Topological Version)

Rudolf Fritsch and Gerda Fritsch
Additional contact information
Rudolf Fritsch: Ludwig-Maximilians-Universität München, Mathematisches Institut
Gerda Fritsch: Ludwig-Maximilians-Universität München, Mathematisches Institut

Chapter Chapter 3 in The Four-Color Theorem, 1998, pp 85-97 from Springer

Abstract: Abstract Generally, when one talks about four specific colors, then one frequently chooses the colors blue, yellow, green, and red.1 For the most part, we will designate these four colors by the numbers 1, 2, 3, 4, and sometimes also by 0,1, 2, 3. This has an additional advantage. One can then extend the discussion to more than four colors without any further difficulty. In fact, one is able to color with n colors, where n is any natural number (n ∈ ℕ). If $$\mathcal{L} $$ is a map, we denote by $${\mathcal{M}_\mathcal{L}} $$ the set of all countries of $$\mathcal{L} $$ . By “coloring” of a map, we intuitively mean that we have one color corresponding to each country of the map (see page 44).

Keywords: Jordan Curve; Exterior Domain; Counterclockwise Direction; Interior Domain; Minimal Counterexample (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1720-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461217206

DOI: 10.1007/978-1-4612-1720-6_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().