graph-coloring
Articles
- Strong coloring(proper) vertex coloring
- Interval coloring
- Uniquely colorable graphGraph with only one possible coloring
- Equitable coloringGraph coloring with equal color classes
- Edge coloringAssignment of colors to edges of a graph
- Interval coloring
- Uniquely colorable graphGraph with only one possible coloring
- TricolorabilityProperty in knot theory
- Acyclic coloringGraph coloring in which all 2-chromatic subgraphs are acyclic
- TricolorabilityProperty in knot theory
- List edge-coloringGraph edge coloring with a limited number of allowed colors
- TricolorabilityProperty in knot theory
- List edge-coloringGraph edge coloring with a limited number of allowed colors
- List coloringGraph coloring where each vertex has a list of allowed colors
- Goldberg–Seymour conjecture
- Kempe chainMathematical device used in proof of the four colour theorem
- Complete coloringVertex coloring where every color pairing appears at least once
- Perfectly orderable graphSpecial case of the perfect graphs in graph theory
- T-coloring
- Strong coloring(proper) vertex coloring
- Harmonious coloringVertex coloring where no two linked nodes have the same color pairing
- Subcoloring
- Strong coloring(proper) vertex coloring
- Edge coloringAssignment of colors to edges of a graph
- Exact coloringGraph coloring with one edge per color pair
- Exact coloringGraph coloring with one edge per color pair
- Oriented coloringSpecial type of graph coloring
- Total coloringGraph coloring of both the edges and vertices
- Tree-depthNumerical invariant of graphs
- Grundy numberMaximum number of colors obtainable by a greedy graph coloring algorithm
- Edge coloringAssignment of colors to edges of a graph
- Interval coloring
- Star coloringGraph coloring avoiding 2-colored paths
- Uniquely colorable graphGraph with only one possible coloring
- TricolorabilityProperty in knot theory
- List edge-coloringGraph edge coloring with a limited number of allowed colors
- Cocoloring
- Exact coloringGraph coloring with one edge per color pair
- Interval coloring
- List edge-coloringGraph edge coloring with a limited number of allowed colors
- Exact coloringGraph coloring with one edge per color pair
- Edge coloringAssignment of colors to edges of a graph
- Strong coloring(proper) vertex coloring
- Uniquely colorable graphGraph with only one possible coloring
- Interval coloring
- List edge-coloringGraph edge coloring with a limited number of allowed colors
- TricolorabilityProperty in knot theory
- Acyclic coloringGraph coloring in which all 2-chromatic subgraphs are acyclic
- Strong coloring(proper) vertex coloring
- Exact coloringGraph coloring with one edge per color pair