Name
Abstract | ||
|---|---|---|
We prove that for d greater-than-or-equal-to 4, d not-equal 5, the edges of the d-dimensional cube can be colored by d colors so that all quadrangles have four distinct colors. (C) 1993 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1002/jgt.3190170507 | Journal of Graph Theory |
Keywords | Field | DocType |
hypercube,quadrangle | Quadrangle,Colored,Combinatorics,Rainbow coloring,Graph colouring,Mathematics,Hypercube,Cube | Journal |
Volume | Issue | ISSN |
17 | 5 | 0364-9024 |
Citations | PageRank | References |
4 | 0.56 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| A. Gyárfás | 2 | 277 | 54.48 |
| L. M. Lesniak | 3 | 44 | 8.23 |
| R. H. Schelp | 4 | 609 | 112.27 |