The complexity of restrictive H-coloring

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

Volumn 2573 LNCS, Issue , 2002, Pages 126-137

  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

GRAPH THEORY;

COLORING PROBLEMS; DICHOTOMY THEOREM; NP COMPLETE; P-COMPLETE; POLYNOMIALLY SOLVABLE; PREIMAGES;

COLORING;

EID: 84901442945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_12     Document Type: Conference Paper

References (14)

1. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters, 42(3):153-159, 1992.
2. J. Díaz. H-colorings of graphs. Bulletin of the European Association for Theoretical Computer Science, (75):82-92, 2001.
3. J. Díaz, M. Serna, and D. M. Thilikos. The complexity of restrictive H-coloring. TR LSI-02-22-R, Software Dept., Universitat Politcnica de Catalunya, 2002.
4. J. Díaz, M. Serna, and D. M. Thilikos. Recent results on parameterized H-colorings. In J. Nešetřil and P. Winkler, editors, Graphs, Morphisms and Statistical Physics, DIMACS series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 2002. To appear.
5. J. Díaz, M. Serna, and D. M. Thilikos. Counting list H-colorings and variants. TR LSI-01-27-R, Software Dept., Universitat Politcnica de Catalunya, 2001.
6. J. Díaz, M. Serna, and D. M. Thilikos. (H,C,K)-colorings: Fast, easy and hard cases. In Mathematical Foundations of Computer Science 2001, MFCS-2001, volume 2136 of LNCS, pages 304-315. Springer-Verlag, 2001.
7. M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Structures Algorithms, 17:260-289, 2000.
8. T. Feder and P. Hell. List homomorphisms to reflexive graphs. Journal of Combinatorial Theory (series B), 72(2):236-250, 1998.
9. T. Feder, P. Hell, and J. Huang. List homomorphisms and circular arc graphs. Combinatorica, 19:487-505, 1999.
10. T. Feder, P. Hell, and J. Huang. Bi-arc graphs and the complexity of list homomorphism. Manuscript, 2001.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
12. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory (series B), 48:92-110, 1990.
13. P. Hell and J. Nešetřil. Counting list homomorphisms and graphs with bounded degrees. In J. Nešetřil and P. Winkler, editors, Graphs, Morphisms and Statistical Physics, DIMACS series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 2002. To appear.
14. J. Nešetřil, 2001. personal communication.