On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236)
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 Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size |
scientific article; zbMATH DE number 7139172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size |
scientific article; zbMATH DE number 7139172 |
Statements
On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (English)
0 references
2 December 2019
0 references
3-colorability problem
0 references
hereditary class
0 references
computational complexity
0 references
0 references
0 references
0 references
