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 the normal view instead:
scientific article; zbMATH DE number 7139172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9164355397224426
0 references
0.8508226275444031
0 references
0.8441035747528076
0 references
0.8248729109764099
0 references
0.8241249918937683
0 references
