On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs |
scientific article; zbMATH DE number 1019044
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs |
scientific article; zbMATH DE number 1019044 |
Statements
On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (English)
0 references
10 June 1997
0 references
\(k\)-colorability problem
0 references
\(k\)-coloring
0 references
Brooks' theorem
0 references
NP-complete
0 references
triangle-free graphs
0 references
