bn:03170337n
Noun Concept
Categories: NP-hard problems, NP-complete problems, Extensions and generalizations of graphs, Computational problems in graph theory, Graph coloring
EN
graph coloring  graph coloring problem  Graph Two-Coloring  Three-Colorable Graph  3-colourability
EN
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. Wikipedia
Assignment of colors to elements of a graph subject to certain constraints Wikidata