Graph Coloring
- Bicolorable Graph
- Bipartite Graph
- Brelaz's Heuristic Algorithm
- Brooks' Theorem
- Chromatic Invariant
- Chromatic Number
- Chromatically Equivalent Graphs
- Chromatically Unique Graph
- Chromial
- Chromic Polynomial
- Chromically Equivalent Graphs
- Chromically Unique Graph
- Chvátal Graph
- Class 1 Graph
- Class 2 Graph
- de Grey Graphs
- Determined by Chromatic Polynomial
- Distinguishing Number
- Double Star Snark
- Earth-Moon Problem
- Edge Chromatic Number
- Edge Coloring
- Empire Problem
- Errera Graph
- Extremal Graph
- Four-Color Theorem
- Fractional Chromatic Number
- Fractional Coloring
- Fractional Edge Chromatic Number
- Franklin Graph
- Fritsch Graph
- Goodman's Formula
- Graham's Number
- Graph Coloring
- Graph Two-Coloring
- Graphoid
- Grünbaum Graphs
- Guthrie's Problem
- Hadwiger Conjecture
- Hadwiger-Nelson Problem
- Hajnal-Szemerédi Theorem
- Heawood Conjecture
- Heawood Four-Color Graph
- Heule Graphs
- Irredundant Ramsey Number
- Isomorphic Factorization
- k-Chromatic Graph
- k-Colorable Graph
- k-Colored Graph
- k-Coloring
- Kempe Chain
- Kittell Graph
- Kneser's Conjecture
- König's Line Coloring Theorem
- Lovász Number
- m-pire Problem
- Map Coloring
- McGregor Map
- Minimum Edge Coloring
- Minimum Vertex Coloring
- Mixon Graphs
- Monochromatic Forced Triangle
- Moser Spindle
- n-Colorable Graph
- n-Colored Graph
- Parts Graphs
- Polyhedron Coloring
- Poussin Graph
- Q-Chromatic Polynomial
- Q-Chromial
- Red Net
- Road Coloring Problem
- Royle Graphs
- Sandwich Theorem
- Schwenk's Formula
- Sigma Polynomial
- Six-Color Theorem
- Soifer Graph
- Strongly Perfect Graph
- Szekeres Snark
- Tait Coloring
- Three-Colorable Graph
- Three-Colorable Map
- Tietze's Graph
- Torus Coloring
- Uniquely Colorable Graph
- Uniquely k-Colorable Graph
- Vertex Coloring
- Vizing's Theorem
- Weakly Perfect Graph
- Weisfeiler-Leman Dimension