Category:Graph coloring

The main article for this categoryisGraph coloring.

Wikimedia Commons has media related to Graph coloring.

The following 82 pages are in this category, out of 82 total. This list may not reflect recent changes.

• 1-factorization

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

• B-coloring
• Brooks' theorem

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

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

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

• Five color theorem
• Four color theorem
• Fractional coloring

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

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

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

• Kempe chain

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

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

• Open coloring axiom
• Oriented coloring

• Path coloring
• Perfectly orderable graph
• Precoloring extension

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

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

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

• Uniquely colorable graph

• Vizing's theorem

• Weak coloring
• Well-colored graph

• Χ-bounded

Languages