complete coloring

graph coloring in which each color pair is represented by an edge of the graph
Class type of: vertex coloring Q3342988

Facts

5 properties
Computational complexity
NP-complete[4]
Introduced in
An interpolation theorem for graphical homomorphisms[5]
🏷️ 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
OpenAlex ID
C21642379
Freebase ID
/m/0332rt
Microsoft Academic ID (discontinued)
21642379

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Computational complexity 1
Instance of 1
Opposite of 1
← Opposite of 1
Press Enter · cited answer in seconds

Summary

complete coloring is a computational problem[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). complete coloring. Retrieved November 15, 2026, from https://4ort.xyz/entity/complete-coloring
MLA “complete coloring.” 4ort.xyz Knowledge Graph, 4ort.xyz, 15 Nov. 2026, https://4ort.xyz/entity/complete-coloring.
BibTeX @misc{4ortxyz_complete-coloring_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{complete coloring}}, year = {2026}, url = {https://4ort.xyz/entity/complete-coloring}, note = {Accessed: 2026-11-15}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): complete coloring — https://4ort.xyz/entity/complete-coloring (retrieved 2026-11-15)

Canonical URL: https://4ort.xyz/entity/complete-coloring · Last refreshed: