Retract rigid Cartesian products of graphs (Q912867)

A graph H is defined to be a retract of the graph G if there are edge- preserving maps \(f: V(H)\to V(G)\) and \(g: V(G)\to V(H)\) such that \(g(f(v))=v,\) for each \(v\in V(G)\) \((''v\in V(G)''\) appears in the paper, but \(''v\in V(H)''\) is correct). Thus H can be regarded as a subgraph of G. Then G is defined to be retract rigid if every retract of itself is isomorphic to G. The principal results of the paper support the view that a graph G plentiful in odd cycles, especially triangles, produces retract rigid Cartesian products \(G\times H\).