A Remark on Rainbow 6-Cycles in Hypercubes
Abstract
We call an edge-coloring of a graph a rainbow coloring if the edges of are colored with distinct colors. For every even positive integer , let denote the minimum number of colors required to color the edges of the -dimensional cube , so that every copy of is rainbow. Faudree et al. [6] proved that for or . Mubayi et al. [8] showed that . In this note, we show that . Moreover, we obtain the number of 6-cycles of .
References
- 1. , Rainbow copies of in edge-colored hypercubes, Discrete Applied Mathematics 210 (2016) 35–37. Crossref, ISI, Google Scholar
- 2. , Graph Theory and Its Application (Macmillan, London and Elsevier, New York, 1976). Google Scholar
- 3. , On the conditional diagnosability of hyper-buttery graphs and related networks, Parallel Processing Letters 26 (2016). https://doi.org/10.1142/S0129626416500055 Link, ISI, Google Scholar
- 4. , Proper distance in edge-colored hypercubes, Applied Mathematics and Computation 313 (2017) 384–391. Crossref, ISI, Google Scholar
- 5. , Strong fault-hamiltonicity for the crossed cube and its extensions, Parallel Processing Letters 27 (2017). https://doi.org/10.1142/S0129626417500050 Link, ISI, Google Scholar
- 6. , Rainbow coloring the cube, Journal of Graph Theory 17 (1993) 607–612. Crossref, ISI, Google Scholar
- 7. , A survey of the theory of hypercube graphs, Computers & Mathematics with Applications 15 (1988) 277–289. Crossref, ISI, Google Scholar
- 8. , Coloring the cube with rainbow cycles, Electronic Journal of Combinatorics 20 (2013) 4–11. Crossref, ISI, Google Scholar


