On the Complexity of Some Colorful Problems Parameterized by Treewidth

DOI10.1007/978-3-540-73556-4_38zbMath1175.68292OpenAlexW1796637954WikidataQ60060515 ScholiaQ60060515MaRDI QIDQ3611990

Carsten Thomassen, Saket Saurabh, Michael R. Fellows, Daniel Lokshtanov, Frances A. Rosamond, Fedor V. Fomin, Stefan Szeider

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

zbMATH Keywords

graph coloringparameterized complexitybounded treewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Parameterized complexity of fair deletion problems ⋮ On the complexity of the regenerator location problem treewidth and other parameters ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ Milling a Graph with Turn Costs: A Parameterized Complexity Perspective ⋮ The complexity ecology of parameters: An illustration using bounded max leaf number ⋮ Walking through waypoints

This page was built for publication: On the Complexity of Some Colorful Problems Parameterized by Treewidth