Parameterized and Exact Computation

DOI10.1007/B100584zbMath1104.68544OpenAlexW2475962691MaRDI QIDQ5311528

Dániel Marx

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100584

zbMATH Keywords

chordal graphscoloringinterval graphsparameterized complexityprecoloring extension

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)

Related Items (1)

Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques

This page was built for publication: Parameterized and Exact Computation