Authors
Citation
Rj. Faudree et al., AN EDGE-COLORING PROBLEM FOR GRAPH PRODUCTS, Journal of graph theory, 23(3), 1996, pp. 297-302
Citations number
7
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
03649024
Volume
23
Issue
3
Year of publication
1996
Pages
297 - 302
Database
ISI
SICI code
0364-9024(1996)23:3<297:AEPFGP>2.0.ZU;2-I
Abstract
The edges of the Cartesian product of graphs G x H are to be colored w
ith the condition that all rectangles, i.e., K-2 x K-2 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. (C) 1996 John Wiley & Sons, I
nc.