complete coloring
graph coloring in which each color pair is represented by an edge of the graph
Facts
5 properties- Instance of
- computational problem
- Subclass of
- vertex coloring[2]
- Computational complexity
- NP-complete[4]
- Introduced in
- An interpolation theorem for graphical homomorphisms[5]
- Opposite of
- harmonious coloring[3]
🏷️ Also known as
en complete coloring
en complete vertex coloring
de vollständige Eckenfärbung
de vollständige Färbung
de vollständige Knotenfärbung
fr Nombre achromatique
fr Nombre Achromatique
hu teljes színezés
pt Coloração completa
ru Полная раскраска
uk повне розфарбування
🔖 Identifiers · 3
🔗 Connections
Computational complexity 1
Instance of 1
Opposite of 1
← Opposite of 1
Press Enter · cited answer in seconds
0 sources
Summary
complete coloring is a computational problem[1].