An edge coloring problem for graph produ
β
Faudree, R. J.; GyοΏ½rfοΏ½s, AndrοΏ½as; Schelp, R. H.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 315 KB
π 1 views
The edges of the Cartesian product of graphs G x H a r e 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