Parameterized and Exact Computation

DOI10.1007/B100584zbMATH Open1104.68544OpenAlexW2475962691MaRDI QIDQ5311528FDOQ5311528

Authors: 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

Recommendations

• Parameterized coloring problems on chordal graphs
• Precoloring extension on chordal graphs
• scientific article; zbMATH DE number 772747
• scientific article; zbMATH DE number 772760
• Precoloring Extension III: Classes of Perfect Graphs

zbMATH Keywords

interval graphschordal graphsparameterized complexitycoloringprecoloring 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)

Cited In (6)

• Parameterized pre-coloring extension and list coloring problems
• Parameterized coloring problems on chordal graphs
• The χt-coloring problem
• Precoloring extension on chordal graphs
• Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
• Coloring chip configurations on graphs and digraphs

This page was built for publication: Parameterized and Exact Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311528)