scientific article; zbMATH DE number 2151250

MaRDI QIDQ4660720zbMATHFDO

Authors Dimitrios M. Thilikos, J. Díaz, Maria Serna

Publication date 4 April 2005

zbMATH Keywords

bounded treewidthcountingparameterized complexityFPT\(H\)-coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)

Recommendations

• Efficient algorithms for parameterized \(H\)-colorings
• scientific article; zbMATH DE number 2156263
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
• Complexity issues on bounded restrictive \(H\)-coloring

Cited in

(8)

• Efficient algorithms for counting parameterized list \(H\)-colorings
• Compactors for parameterized counting problems
• Complexity issues on bounded restrictive \(H\)-coloring
• The restrictive \(H\)-coloring problem
• List matrix partitions of chordal graphs
• The complexity of counting surjective homomorphisms and compactions
• List homomorphisms of graphs with bounded degrees
• Efficient algorithms for parameterized \(H\)-colorings

This page was built for publication:

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