Rainbow coloring the cube
✍ Scribed by R. J. Faudree; A. Gyárfás; L. Lesniak; R. H. Schelp
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 258 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We prove that for d ≥ 4, d ≠ 5, the edges of the d‐dimensional cube can be colored by d colors so that all quadrangles have four distinct colors. © 1993 John Wiley & Sons, Inc.
📜 SIMILAR VOLUMES
## Abstract A face of an edge‐colored plane graph is called __rainbow__ if the number of colors used on its edges is equal to its size. The maximum number of colors used in an edge coloring of a connected plane graph __G__with no rainbow face is called __the edge‐rainbowness__ of __G__. In this pap
**In the future, time travelers are a reality. In the present, time travlers are a real pain.** June Moore guards our present day from those who visit from the future. Their advanced knowledge and weaponry threaten to wreak havoc on our lives. And law enforcement is clueless about their future
**In the future, time travelers are a reality. In the present, time travlers are a real pain.** June Moore guards our present day from those who visit from the future. Their advanced knowledge and weaponry threaten to wreak havoc on our lives. And law enforcement is clueless about their future