scientific article; zbMATH DE number 2151250
From MaRDI portal
Publication:4660720
zbMATH Open1060.05030MaRDI QIDQ4660720FDOQ4660720
Authors: Dimitrios M. Thilikos, J. Díaz, Maria Serna 
Publication date: 4 April 2005
Title of this publication is not available (Why is that?)
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
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)
Cited In (8)
- Compactors for parameterized counting problems
- The Complexity of Counting Surjective Homomorphisms and Compactions
- The restrictive \(H\)-coloring problem
- Complexity issues on bounded restrictive \(H\)-coloring
- List homomorphisms of graphs with bounded degrees
- Efficient algorithms for counting parameterized list \(H\)-colorings
- Efficient algorithms for parameterized \(H\)-colorings
- List matrix partitions of chordal graphs
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)
