graph coloring
assignment of colors to elements of a graph subject to certain constraints
Facts
5 properties- Instance of
- computational problem
- Subclass of
- graph labeling[2]
- ACM Classification Code (2012)
- 10003639[4]
- Computational complexity
- NP-complete[6]
- Different from
- edge coloring[3]
🏷️ Also known as
en graph coloring problem
en graph colouring
en graph coloring
ar تلوين مخطط
ar تلوين مخطط بثلاثة ألوان
ar مشكله تلوين المخطط
ar تلوين مخطط مستو بثلاثة ألوان
ar تلوين مخطط بثلاثه ألوان
ar مسألة تلوين البيان
ar تلوين مخطط مستو بثلاثه ألوان
ar تلوين المخطط
cs obarvení grafu
cs barvení grafu
de Färbung von Graphen
de Färbbarkeit
de Eindeutig k-färbbarer Graph
de Knotenfärbung
de K-kantenfärbbarer Graph
de K-färbbarer Graph
de Färbung
🔖 Identifiers · 15
- Library of Congress Authorities ID
- sh2004000285
- OpenAlex ID
- C76946457
- Brilliant Wiki ID
- graph-coloring-and-chromatic-numbers
- Dictionary of Algorithms and Data Structures ID
- graphcolorng
- Freebase ID
- /m/02749z
- Great Russian Encyclopedia portal ID
- raskraska-grafa-aa470e
- J9U entity ID
- 987007539706505171
- KBpedia ID
- GraphColoring
- Larousse ID
- divers/coloriage/35299
- MathWorld ID
- GraphColoring
- Microsoft Academic ID (discontinued)
- 76946457
- Quora topic ID
- Graph-Coloring
Show all 15 identifiers +3
- Stack Exchange tag
- cstheory.stackexchange.com
- Topic's main category
- Category:Graph coloring
- Yale LUX ID
- concept/a02e0050-99c3-4652-a848-5f24187f58de
🔗 Connections
Subtypes 4
← Facet of 2
Computational complexity 1
Different from 1
Instance of 1
Maintained by WikiProject 1
Subclass of 1
Topic's main category 1
← Category's main topic 1
← Different from 1
← Main subject 1
← Statement describes 1
Press Enter · cited answer in seconds
0 sources
Summary
graph coloring is a computational problem[1].