The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:29, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs |
scientific article |
Statements
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (English)
0 references
29 June 2015
0 references
3-colorability problem
0 references
computational complexity
0 references
polynomial-time algorithm
0 references
