Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:28, 5 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
