complete coloring
Sign in to saveAlso known as complete vertex coloring
graph coloring in which each color pair is represented by an edge of the graph
Wikidata facts
- Instance of
- computational problem
Show 2 more facts
- computational complexity
- NP-complete
- opposite of
- harmonious coloring
Sources (3)
via Wikidata · CC0