Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Decision problem
NP-complete problem Computational problem |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
Undirected graphs
|
| gptkbp:field |
gptkb:Graph_theory
gptkb:Theoretical_computer_science |
| gptkbp:firstProvedNPCompleteBy |
gptkb:Richard_Karp
|
| gptkbp:generalizes |
2-Colorability
|
| gptkbp:hasReductionFrom |
gptkb:3-SAT
|
| gptkbp:hasSpecialCase |
k-Colorability
|
| https://www.w3.org/2000/01/rdf-schema#label |
Graph 3-Colorability
|
| gptkbp:input |
graph
|
| gptkbp:NPCompletenessYear |
1972
|
| gptkbp:output |
Yes or No
|
| gptkbp:reduces |
gptkb:Clique_problem
|
| gptkbp:relatedTo |
gptkb:Graph_coloring
3-coloring |
| gptkbp:type |
Can the vertices of a given graph be colored with at most 3 colors so that no two adjacent vertices share the same color?
|
| gptkbp:usedIn |
gptkb:Complexity_theory
Combinatorics Algorithm design |
| gptkbp:bfsParent |
gptkb:Graph_Non-3-Colorability
|
| gptkbp:bfsLayer |
6
|