Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complement |
gptkb:Graph_3-Colorability
|
| gptkbp:complexity |
gptkb:co-NP-complete
|
| https://www.w3.org/2000/01/rdf-schema#label |
Graph Non-3-Colorability
|
| gptkbp:input |
graph
|
| gptkbp:output |
no if the graph can be colored with 3 colors
yes if the graph cannot be colored with 3 colors |
| gptkbp:relatedTo |
graph theory
NP-complete problem 3-coloring |
| gptkbp:type |
Is a given graph not 3-colorable?
|
| gptkbp:usedIn |
theoretical computer science
algorithm design |
| gptkbp:bfsParent |
gptkb:co-NP
|
| gptkbp:bfsLayer |
5
|