Graph Coloring

← Back to Domain-Specific Abstractions by Domain

2 domain-specific abstractions whose origin domain is Graph Coloring.

• Exact coloring — A proper vertex coloring in which each unordered pair of distinct colors occurs on exactly one edge.
• Well-colored graph — A graph for which greedy vertex coloring uses the chromatic number of colors under every vertex ordering.