Category:Graph coloring

• Graph coloring

0–9

• 1-factorization

A

• Acyclic coloring
• Adjacent-vertex-distinguishing-total coloring
• Albertson conjecture

B

• B-coloring
• Brooks' theorem

C

• Cereceda's conjecture
• Chromatic polynomial
• Circular coloring
• Cocoloring
• Col (game)
• Complete coloring
• Conflict-free coloring
• Critical graph

D

• De Bruijn–Erdős theorem (graph theory)
• Defective coloring
• Dinitz conjecture
• Distinguishing coloring
• DSatur

E

• Earth–Moon problem
• Edge coloring
• Equitable coloring
• Erdős–Faber–Lovász conjecture
• Exact coloring

F

• Five color theorem
• Four color theorem
• Fractional coloring

G

• Gallai–Hasse–Roy–Vitaver theorem
• Goldberg–Seymour conjecture
• Graph coloring game
• Greedy coloring
• Grötzsch's theorem
• Grundy number
• Gyárfás–Sumner conjecture

H

• Hadwiger conjecture (graph theory)
• Hadwiger–Nelson problem
• Hajós construction
• Hamiltonian coloring
• Harmonious coloring
• Heawood conjecture
• Heawood number
• Hedetniemi's conjecture

I

• Incidence coloring
• Interval chromatic number of an ordered graph
• Interval edge coloring

K

• Kempe chain

L

• L(2,1)-coloring
• L(h, k)-coloring
• List coloring
• List edge-coloring

M

• The Mathematical Coloring Book
• Misra & Gries edge coloring algorithm
• Monochromatic triangle
• Multi-trials technique

O

• Open coloring axiom
• Oriented coloring

P

• Path coloring
• Perfectly orderable graph
• Precoloring extension

R

• Radio coloring
• Rainbow coloring
• Rainbow matching
• Recursive largest first algorithm
• Road coloring theorem

S

• Shift graph
• Snark (graph theory)
• Star coloring
• Strong coloring
• Subcoloring
• Sum coloring
• Symmetric hypergraph theorem

T

• T-coloring
• Thue number
• Total coloring
• Tree-depth
• Tricolorability

U

• Uniquely colorable graph

V

• Vizing's theorem

W

• Weak coloring
• Well-colored graph

Χ

• Χ-bounded