Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637)
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: Deciding k-colorability of P₅-free graphs in polynomial time |
scientific article; zbMATH DE number 5677428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time |
scientific article; zbMATH DE number 5677428 |
Statements
Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (English)
0 references
4 March 2010
0 references
graph coloring
0 references
dominating clique
0 references
polynomial-time algorithm
0 references
\(P_5\)-free graph
0 references
0.8927943110466003
0 references
0.8773960471153259
0 references
0.8771463632583618
0 references
0.8697841167449951
0 references
0.8640203475952148
0 references
