Between 2- and 3-colorability (Q5902303)
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 5642338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Between 2- and 3-colorability |
scientific article; zbMATH DE number 5642338 |
Statements
Between 2- and 3-colorability (English)
0 references
4 December 2009
0 references
3-colorability
0 references
polynomial-time algorithm
0 references
hereditary class of graphs
0 references
computational complexity
0 references
0.7894741892814636
0 references
0.7869453430175781
0 references
0.7802075147628784
0 references
