Given two graphs A and G, we write if there is a homomorphism of A to G and if there is no such homomorphism. The graph G is -free if, whenever both a and c are adjacent to b and d, then a = c or b = d. We will prove that if A and B are connected graphs, each containing a triangle and if G is a -free graph with and , then (here "" denotes the categorical product).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 31, 1998/Revised April 19, 2000
RID="†"
ID="†" Supported by NSERC of Canada Grant #691325.
Rights and permissions
About this article
Cite this article
Delhommé, C., Sauer, N. Homomorphisms of Products of Graphs into Graphs Without Four Cycles. Combinatorica 22, 35–46 (2002). https://doi.org/10.1007/s004930200002
Issue Date:
DOI: https://doi.org/10.1007/s004930200002