Three complexity results on coloring \(P_k\)-free graphs (Q1933643): 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.ejc.2011.12.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159829425 / rank | |||
Normal rank | |||
Revision as of 23:33, 19 March 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
