The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536)
From MaRDI portal
!
WARNING
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 6789916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs |
scientific article; zbMATH DE number 6789916 |
Statements
The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (English)
0 references
11 October 2017
0 references
vertex 3-colorability problem
0 references
computational complexity
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0.9164355397224426
0 references
0.8808875679969788
0 references
0.8583531975746155
0 references
0.8484616875648499
0 references
0.8364121317863464
0 references
