Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2014.02.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974068132 / rank | |||
Normal rank | |||
Revision as of 20:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Closing complexity gaps for coloring problems on \(H\)-free graphs |
scientific article |
Statements
Closing complexity gaps for coloring problems on \(H\)-free graphs (English)
0 references
18 July 2014
0 references
graph coloring
0 references
precoloring extension
0 references
list coloring
0 references
forbidden induced subgraph
0 references
