Name
Abstract | ||
|---|---|---|
The edges of the Cartesian product of graphs G x H are to be colored with 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, Inc. |
Year | DOI | Venue |
|---|---|---|
1996 | 3.3.CO;2-J" target="_self" class="small-link-text"10.1002/(SICI)1097-0118(199611)23:33.3.CO;2-J | Journal of Graph Theory |
Keywords | Field | DocType |
edge coloring | Edge coloring,Discrete mathematics,Complete coloring,Topology,Combinatorics,Comparability graph,Graph power,Fractional coloring,List coloring,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
23 | 3 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| András Gyárfás | 2 | 582 | 102.26 |
| R. H. Schelp | 3 | 609 | 112.27 |