Complexity of homomorphisms to direct products of graphs

Authors:
Judit Büki;Csaba Szabó
Affiliations:
Carmelite convent, Tettye u. 14 H-7625 Pécs, Hungary;Eötvös Loránd University, Department of Algebra and Number Theory, Kecskeméti u. 10-12, H-1051 Budapest, Hungary
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 0

Absolute retracts of bipartite graphs

Discrete Applied Mathematics
On the complexity of H-coloring

Journal of Combinatorial Theory Series B
Monotone monadic SNP and constraint satisfaction

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
List homomorphisms to reflexive graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.89

Visualization

Abstract

For a graph G, OALG asks whether or not an input graph H together with a partial map g:S → G, S ⊆ V(H), admits a homomorphism f:H → G such that f|s = g. We show that for connected graphs G1, G2, OAL G1 × G2 is in P if G1 and G2 are trees and NP-complete otherwise.