scientific article; zbMATH DE number 2151250

MaRDI QIDQ4660720zbMATH OpenFDO

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

Publication date 4 April 2005

zbMATH Keywords

\(H\)-coloringbounded treewidthcountingFPTparameterized complexity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10) 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

(10)

• The restrictive \(H\)-coloring problem
• Complexity issues on bounded restrictive H-coloring
• Efficient algorithms for parameterized H-colorings
• The complexity of counting surjective homomorphisms and compactions
• Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
• List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
• List matrix partitions of chordal graphs
• Compactors for parameterized counting problems
• List homomorphisms of graphs with bounded degrees
• Efficient algorithms for counting parameterized list 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)