On the Complexity of Some Colorful Problems Parameterized by Treewidth
From MaRDI portal
Publication:3611990
DOI10.1007/978-3-540-73556-4_38zbMath1175.68292WikidataQ60060515 ScholiaQ60060515MaRDI QIDQ3611990
Michael R. Fellows, Carsten Thomassen, Frances A. Rosamond, Fedor V. Fomin, Saket Saurabh, Stefan Szeider, Daniel Lokshtanov
Publication date: 3 March 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/b39750e7-83a8-47f0-b94e-5373201fc6dc
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)