Related articles:
Theorem
Planar graph
Mathematical proof
Torus
Mathematics
Klein bottle
Key terms:
colors
proof
graph
theorem
vertex
configuration
appel
proving
four color
vertices
reducible
touches
teorema
snark
torus
kempe
flaw
contiguous
counterexample
planar graph
discharging
conjecture
five colors
graph theory
four color theorem
unavoidable set
fredrick
each vertex
triangulated
reducible configurations
arbitrarily
kempe chain
appel and haken
vertex of degree
four colours
every planar
touches every
graph coloring
colors suffice
discharging procedure
minimal counterexample
remaining regions
five color theorem
most four colors so
euler characteristic
colors so that no two
red and blue neighbors
four colors so that no
so that no two adjacent
single vertex with degree
Search external links cited by footnotes on Wikipedia page Four color theorem:
|
|