Three complexity results on coloring \(P_k\)-free graphs (Q1933643)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Three complexity results on coloring P_k-free graphs |
scientific article; zbMATH DE number 6128660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three complexity results on coloring \(P_k\)-free graphs |
scientific article; zbMATH DE number 6128660 |
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
