The edges of the Cartesian product of graphs G x H are to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H is 4- or 5-chromatic.
|Number of pages||6|
|Journal||Journal of Graph Theory|
|Publication status||Published - Nov 1996|
ASJC Scopus subject areas
- Geometry and Topology