The complexity of the \(T\)-coloring problem for graphs with small degree
From MaRDI portal
(Redirected from The complexity of the T-coloring problem for graphs with small degree)
The complexity of the \(T\)-coloring problem for graphs with small degree
The complexity of the \(T\)-coloring problem for graphs with small degree
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
