Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of testing whether a given graph G allows a homomorphism to a given graph H that is locally bijective, surjective, or injective, respectively, are NP-complete, even when G has pathwidth at most 5, 4 or 2, respectively, or when both G and H have maximum degree 3. We complement these hardness results by showing that the three problems are polynomial-time solvable if G has bounded treewidth and in addition G or H has bounded maximum degree.
KeywordsPolynomial Time Maximum Degree Constraint Satisfaction Problem Tree Decomposition Surjective Homomorphism
Unable to display preview. Download preview PDF.
- 1.Angluin, D.: Local and global properties in networks of processors. In: Proc. STOC 1980, pp. 82–93 (1980)Google Scholar
- 3.Biggs, N.: Algebraic Graph Theory. Cambridge University Press (1974)Google Scholar
- 16.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman & Co., New York (1979)Google Scholar
- 17.Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54 (2007)Google Scholar
- 20.Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press (2004)Google Scholar
- 22.Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer (1994)Google Scholar
- 26.Massey, W.S.: Algebraic Topology: An Introduction. Harcourt, Brace and World (1967)Google Scholar