Graph Coloring
- 1-2-3 Conjecture
- Achromatic Number
- Additive Coloring
- Alon-Krivelevich Conjecture
- Alon-Saks-Seymour Conjecture
- Alon-Tarsi Number
- Amenable Graph
- B-Coloring
- Balanced Edge Coloring
- Bicolorable Graph
- Bipartite Graph
- Bipartition
- Brelaz's Heuristic Algorithm
- Brooks' Theorem
- Burr-Erdős-Graham-Sós Conjecture
- Cameron-Montanaro-Newman-Severini-Winter Graph
- Chiu Graph
- Choice Number
- Chromatic Invariant
- Chromatic Number
- Chromatic Polynomial
- Chromatic Root
- Chromatic Root-Free Interval
- Chromatic Symmetric Function
- Chromatic Villainy
- Chromatically Equivalent Graphs
- Chromatically Unique Graph
- Chvátal Graph
- Circular Chromatic Number
- Class 1 Graph
- Class 2 Graph
- Clustered Chromatic Number
- Clustered Coloring
- Colin de Verdière Chromatic Conjecture
- Color Coding
- Color Refinement
- Colorful Cycle
- Colorful Cycle Problem
- Colorful Subgraph
- Conflict-Free Coloring
- Correspondence Chromatic Number
- Correspondence Coloring
- Cyclic Chromatic Number
- Cyclic Coloring Conjecture
- D-Coloring
- de Grey Graphs
- Defective Coloring
- Dichromatic Number
- Distinguishing Number
- Dominating Hadwiger Conjecture
- Double Star Snark
- Earth-Moon Problem
- Edge Chromatic Number
- Edge Coloring
- Edge Coloring Problem
- Edge-Critical Graph
- Empire Problem
- Enumerative Chromatic Choosability
- Erdős-Faber-Lovász Conjecture
- Erdős-Gyárfás Balanced Coloring Conjecture
- Erdős-Hajnal Conjecture
- Erdős-Lovász Tihany Conjecture
- Erdős-Nešetril Conjecture
- Errera Graph
- Extremal Graph
- Four-Color Theorem
- Fractional Chromatic Number
- Fractional Coloring
- Fractional Edge Chromatic Number
- Franklin Graph
- Fritsch Graph
- Frugal Coloring
- Generalized Ramsey Number
- Goodman's Formula
- Graham's Number
- Graph Coloring
- Graph Recoloring
- Graph Two-Coloring
- Graphoid
- Grünbaum Graphs
- Guthrie's Problem
- Hadwiger Conjecture
- Hadwiger-Nelson Problem
- Hajnal-Szemerédi Theorem
- Hajós Conjecture
- Harvey-Royle Graphs
- Heawood Conjecture
- Heawood Four-Color Map
- Hedetniemi's Conjecture
- Heule Graphs
- Irredundant Ramsey Number
- Isomorphic Factorization
- k-Chromatic Graph
- k-Colorable Graph
- k-Colored Graph
- k-Coloring
- Kempe Chain
- Kempe's Coloring Algorithm
- Kempe Impasse
- Kempe-Kittell Coloring Algorithm
- Kiteck-Payne Graph
- Kittell Graph
- Kneser's Conjecture
- König's Line Coloring Theorem
- Lalonde Graph
- Linear Hadwiger Conjecture
- List Color Function
- List Coloring
- List Total Chromatic Number
- List Total Coloring Conjecture
- Local Antimagic Chromatic Number
- Local Antimagic Graph
- Local Antimagic Labeling
- Lovász Number
- Mančinska-Roberson Graphs
- Map Coloring
- McGregor Map
- Minimum Edge Coloring
- Minimum Vertex Coloring
- Minkowski Plane
- Mixon Graphs
- Monochromatic Forced Triangle
- Moore Four-Color Graph
- Moser Spindle
- Norine's Antipodal-Coloring Conjecture
- Odd Hadwiger Conjecture
- One-Factorization
- Overfull Graph
- Packing Coloring
- Partial List Coloring Conjecture
- Parts Graphs
- Petersen Coloring
- Petersen Coloring Conjecture
- Polyhedron Coloring
- Poussin Graph
- Proper Coloring
- Proportional Choice Number
- Q-Chromatic Polynomial
- Quantum Chromatic Number
- Rainbow Subgraph
- Red Net
- Road Coloring Problem
- Royle Graphs
- Sandwich Theorem
- Schrijver Graph
- Schwenk's Formula
- Shift Graph
- Sigma Polynomial
- Signed Circular Chromatic Number
- Six-Color Theorem
- Soifer Graph
- Sphere Chromatic Number
- Stable Coloring
- Strong Edge Coloring
- Strong Fractional Choice Number
- Strongly Perfect Graph
- Szekeres Snark
- Tait Coloring
- Three-Colorable Graph
- Three-Colorable Map
- Tietze Graph
- Torus Coloring
- Total Chromatic Number
- Total Coloring Conjecture
- Tropical Subgraph
- Tutte Three-Edge-Coloring Conjecture
- Uniquely Colorable Graph
- Vector Chromatic Number
- Vertex-Colored Graph
- Vertex Coloring
- Vertex Coloring Problem
- Vertex-Critical Graph
- Vizing's Theorem
- Wagon USA Map Graph
- Weakly Perfect Graph
- Weisfeiler-Leman Algorithm
- Weisfeiler-Leman Dimension