Improved complexity results on \(k\)-coloring \(P t\)-free graphs
From MaRDI portal
(Redirected from Improved complexity results on k-coloring P_t-free graphs)
Improved complexity results on \(k\)-coloring \(P t\)-free graphs
Improved complexity results on \(k\)-coloring \(P t\)-free graphs
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
