|
|||||
|
|
An edge coloring problem for graph products |
|
| Authors: | R J Faudree Andras Gyrfs R H Schelp |
| Abstract: | The edges of the Cartesian product of graphs G × H are to be colored with the condition that all rectangles, i.e., K2 × 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. © 1996 John Wiley & Sons, Inc. |
| Keywords: | |