On the complexity of some colorful problems parameterized by treewidth
From MaRDI portal
Publication:627124
DOI10.1016/j.ic.2010.11.026zbMath1223.05070WikidataQ56926595 ScholiaQ56926595MaRDI QIDQ627124
Michael R. Fellows, Carsten Thomassen, Frances A. Rosamond, Fedor V. Fomin, Saket Saurabh, Stefan Szeider, Daniel Lokshtanov
Publication date: 21 February 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://backend.orbit.dtu.dk/ws/files/5275033/195.Fellows%20et%20al.pdf
05C15: Coloring of graphs and hypergraphs