Dichotomy for bounded degree H-colouring

@article{Siggers2009DichotomyFB,
  title={Dichotomy for bounded degree H-colouring},
  author={Mark H. Siggers},
  journal={Discrete Applied Mathematics},
  year={2009},
  volume={157},
  pages={201-210}
}
Given a graph H , let b(H) be the minimum integer b, if it exists, for which H -colouring is N P-complete when restricted to instances with degree bounded by b. We show that b(H) exists for any non-bipartite graph. This verifies for graphs the conjecture of Feder, Hell, and Huang that any CSP that is N P-complete, is N P-complete for instances of some maximum degree. Furthermore, we show the same for all projective CSPs, and we get constant upper bounds on the parameter b for various infinite… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On the complexity of the general coloring problem

  • H. Mauer, J. Sudborough, E. Welzl
  • Inform. Control 51
  • 1981
Highly Influential
1 Excerpt

Graphs and Homomorphisms

  • P. Hell, J. Nešetřil
  • Oxford University Press
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…