(H,C,K)-coloring: Fast, easy, and hard cases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 304-315

  Díaz, Josep ^a   Serna, Maria ^a   Thilikos, Dimitrios M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COLORING PROBLEMS; LOOPLESS; NP COMPLETE; PARAMETERIZED; PREIMAGES;

ARTIFICIAL INTELLIGENCE;

EID: 84974704970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_27     Document Type: Conference Paper

References (8)

1. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer-Verlag, New York, 1999.
2. Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. Counting list Hcolorings and variants. Technical Report LSI-01-27-R, Departament de Llenguatges i Sistemes Inform`atics, Universitat Polit`ecnica de Catalunya, Barcelona, Spain, 2001.
3. Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. Evaluating H-colorings of graphs with bounded decomposability. In Proceedings of The 7th Annual International Computing and Combinatorics Conference, COCOON 2001, 2001.
4. Tomas Feder and Pavol Hell. List homomorphisms to reflexive graphs. Journal of Combinatorial Theory (series B), 72(2):236-250, 1998
5. Tomas Feder, Pavol Hell, and Jing Huang. List homomorphisms and circular arc graphs. Combinatorica, 19(4):487-505, 1999
6. Anna Galluccio, Pavol Hell, and Jaroslav Nešetřil. The complexity of Hcolouring of bounded degree graphs. Discrete Mathematics, 222(1-3):101-109, 2000.
7. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory (series B), 48:92-110, 1990.
8. Jan Arne Telle and Andrzej Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics, 10(4):529-550, 1997.