Category:Graph coloring

• Graph coloring (computing)

1

• 1-factorization (computing)

A

• Acyclic coloring (computing)
• Adjacent-vertex-distinguishing-total coloring (computing)
• Albertson conjecture (computing)

B

• B-coloring (computing)
• Brooks' theorem (computing)

C

• Cereceda's conjecture (computing)
• Chromatic polynomial (computing)
• Circular coloring (computing)
• Cocoloring (computing)
• Col (game) (software)
• Complete coloring (computing)
• Critical graph (computing)

D

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

E

• Edge coloring (computing)
• Equitable coloring (computing)
• Erdős–Faber–Lovász conjecture (computing)
• Exact coloring (computing)

F

• Five color theorem (computing)
• Four color theorem (computing)
• Fractional coloring (computing)

G

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

H

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

I

• Incidence coloring (computing)
• Interval chromatic number of an ordered graph (computing)
• Interval edge coloring (computing)

K

• Kempe chain (computing)

L

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

M

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

O

• Oriented coloring (computing)

P

• Path coloring (computing)
• Perfectly orderable graph (computing)
• Precoloring extension (computing)

R

• Radio coloring (computing)
• Rainbow coloring (computing)
• Rainbow matching (computing)
• Road coloring theorem (computing)

S

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

T

• T-coloring (computing)
• Thue number (computing)
• Total coloring (computing)
• Tree-depth (computing)
• Tricolorability (computing)

U

• Uniquely colorable graph (computing)

V

• Vizing's theorem (computing)

W

• Weak coloring (computing)
• Well-colored graph (computing)

Χ

• Χ-bounded (computing)