Three complexity results on coloring \(P_k\)-free graphs (Q1933643): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Hajo J. Broersma / rank | |||
| Property / author | |||
| Property / author: Petr A. Golovach / rank | |||
Revision as of 07:15, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three complexity results on coloring \(P_k\)-free graphs |
scientific article |
Statements
Three complexity results on coloring \(P_k\)-free graphs (English)
0 references
24 January 2013
0 references
dominating clique
0 references
polynomial-time algorithm
0 references
path free graphs
0 references
vertex colouring problems
0 references
pre-colouring extension
0 references
polymial solvability
0 references
