Complexity of homomorphisms to direct products of graphs
References (8)
- et al.
List homomorphism to reflexive graphs
J. Combin. Theory B
(1998) - et al.
On the complexity of H-coloring
J. Combin. Theory B
(1990) - et al.
Absolute retracts of bipartite graphs
Discrete Appl. Math.
(1987) - T. Feder, P. Hell, J. Huang, List homomorphisms to general graphs, Manuscript,...
There are more references available in the full text version of this article.
Cited by (2)
On the extension of vertex maps to graph homomorphisms
2006, Discrete MathematicsCitation Excerpt :Further studies of retracts are given by Erwin Pesch in [21–23]. The more computational aspect of determining when a given graph is a retract is given in [3,9]. In [25] the retract is studied from the more classical graph-contraction point of view.
- 1
The research of the first author was partially supported by the Közjóért alapı́tvány Foundation of the National Bank of Hungary, and of the second author by the Hungarian National Fundation for Scientific Research, Grant F32325.
Copyright © 2002 Elsevier Science B.V. All rights reserved.