Related terms:
edge coloring
four colours
color theorem
minimal counterexample
vertex coloring
suffice
edge chromatic number
vertex of degree
greedy coloring
edge coloring of a graph
coloring problem
distributed algorithm
ramsey theory
graph coloring
perfect graph
line graph
five colors
every pair
planar graphs
maximum degree
weisstein
four color theorem
chromatic polynomial
unavoidable
register allocation
discharging
chromatic number
triangulated
greedy algorithm
kempe
Wikipedia sources:
Graph coloring
Four color theorem
Context for words:
every
planar
|
|