Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
theoretical computer science |
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a graph, determine if its vertices can be colored with 3 colors so that no two adjacent vertices share the same color.
|
| gptkbp:estimatedCost |
no (unless P=NP)
|
| gptkbp:field |
theoretical computer science
graph theory |
| gptkbp:firstProvedNPCompleteBy |
gptkb:Richard_Karp
|
| gptkbp:generalizes |
gptkb:2-coloring_problem
|
| gptkbp:hasSpecialCase |
gptkb:k-coloring_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
3-coloring problem
|
| gptkbp:input |
graph
|
| gptkbp:output |
yes/no answer
|
| gptkbp:relatedTo |
gptkb:NP-completeness
graph coloring |
| gptkbp:solvedBy |
gptkb:SAT_solvers
backtracking algorithms |
| gptkbp:usedIn |
gptkb:complexity_theory
algorithm design constraint satisfaction problems |
| gptkbp:yearNPCompletenessProved |
1972
|
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|