Between 2- and 3-colorability (Q5902303): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:51, 30 January 2024
scientific article; zbMATH DE number 5642338
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
