Showing papers on "Cartesian product of graphs published in 1992"
TL;DR: There exist strong products of graphs in which a projection of a retract onto a factor is not a retract of the factor and it is shown that in the Cartesian product of graphs G and H, any tringles of G transfer in H are connected and G is strongly-triangulated, weakly-Triangulated or four-cycle free.
11 citations
TL;DR: This paper completely characterize the graphs that are both nontrivial cartesian products and s-strongly perfect, via the strong perfect graph conjecture.
Abstract: The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In “Perfect Product Graphs” (Discrete Mathematics, Vol. 20, 1977, pp. 177--186), G. Ravindra and K. R. Parthasarathy tried, but unfortunately without success, to characterize the perfectness of the cartesian product of graphs (see also MR No. 58--10567, 1979). In this paper we completely characterize the graphs that are both nontrivial cartesian products and s-strongly perfect.