Locally injective graph homomorphism: Lists guarantee dichotomy

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

Volumn 4271 LNCS, Issue , 2006, Pages 15-26

  Fiala, Jiří ^a   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

DICHOTOMY; GRAPH HOMOMORPHISM; LIST VERSION;

GRAPH THEORY;

EID: 33845545644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_2     Document Type: Conference Paper

References (19)

1. ANGLUIN, D. Local and global properties in networks of processors. Proceedings of the 12th ACM Symposium on Theory of Computing (1980), 82-93.
2. BIGGS, N. Constructing 5-arc transitive cubic graphs. Journal of London Mathematical Society II. 26 (1982), 193-200.
3. BODLAENDER, H. L. The classification of coverings of processor networks. Journal of Parallel Distributed Computing 6 (1989), 166-182.
4. BULATOV, A. A., JEAVONS, P., AND KROKHIN, A. A. Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34, 3 (2005), 720-742.
5. FEDER, T., HELL, P., KLEIN, S., AND MOTWANI, R. List partitions. SIAM J. Discrete Math. 16, 3 (2003), 449-478.
6. FEDER, T., AND VARDI, M. Y. The computational structure of momotone monadic SNP and constraint satisfaction: A sudy through datalog and group theory. SIAM Journal of Computing 1 (1998), 57-104.
7. FIALA, J. NP completeness of the edge precoloring extension problem on bipartite graphs. Journal of Graph Theory 43, 2 (2003), 156-160.
8. FIALA, J., AND KRATOCHVÍL, J. Complexity of partial covers of graphs. In Algorithms and Computation, 12th ISAAC '01, Christchurch, New Zealand (2001), no. 2223 in Lecture Notes in Computer Science, Springer Verlag, pp. 537-549.
9. FIALA, J., AND KRATOCHVÍL, J. Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002), 89-99.
10. FIALA, J., KRATOCHVÍL, J., AND PÓR, A. On the computational complexity of partial covers of theta graphs. Electronic Notes in Discrete Mathematics 19 (2005), 79-85.
11. FIALA, J., AND PAULUSMA, D. A complete complexity classification of the role assignment problem. Theoretical Computer Science 1, 349 (2005), 67-81.
12. HELL, P. From homomorphisms to colorings and back, in Topics in Discrete Mathematics, Dedicated to J. Nešetřil on the occasion of his 60th birthday, (M. Klazar, J. Kratochvíl, J. Matoušek, M. Loebl, R. Thomas and P. Valtr, eds.), Springer, 2006, pp. 407-432.
13. HELL, P., AND NEŠETŘIL, J. On the complexity of H-colouring. Journal of Combinatorial Theory B 48 (1990), 92-110.
14. HELL, P., AND NEŠETŘIL, J. Graphs and Homomorphisms. Oxford University Press, 2004.
15. 4,4 - e. has no finite planar cover. Journal of Graph Theory 21, 1 (1998), 51-60.
16. KRATOCHVÍL, J., PROSKUROWSKI, A., AND TELLE, J. A. Covering regular graphs. Journal of Combinatorial Theory B 71, 1 (Sept 1997), 1-16.
17. KRISTIANSEN, P., AND TELLE, J. A. Generalized H-coloring of graphs. In Algorithms and Computation, 11th ISAAC '01, Taipei, Taiwan (2000), no. 1969 in Lecture Notes in Computer Science, Springer Verlag, pp. 456-466.
18. MARX, D. NP-completeness of list coloring and precoloring extension on the edges of planar graphs. Journal of Graph Theory 49 4 (2005) 313-324.
19. SCHAEFER, T. J. The complexity of the satisfability problem. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (1978), ACM, pp. 216-226.