Rainbow numbers for small cycles

Lv, Bihong; Ye, Kecai; Wang, Huaping

doi:10.28919/jmcs/3629

J. Math. Comput. Sci. 8 (2018), 297–303

Rainbow numbers for small cycles

Bihong Lv, Kecai Ye, Huaping Wang

PDF (124.2 KB) https://doi.org/10.28919/jmcs/3629

Abstract

The rainbow number $rb(G,H)$ is the minimum number $k$ such that any $k$-edge-coloring of $G$ contains a rainbow copy of $H$. In this paper, we determine the rainbow numbers of small cycles in the complete split graph and maximal outerplanar graph.

Published: 3 March 2018
Volume: 8 (2018)
License: CC BY 3.0

Copyright © 2018 Bihong Lv, Kecai Ye, Huaping Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Cite this article

B. Lv, K. Ye, H. Wang, Rainbow numbers for small cycles, J. Math. Comput. Sci. 8 (2018), 297–303. https://doi.org/10.28919/jmcs/3629

BibTeX

@article{Lv2018,
  author  = {Lv, Bihong and Ye, Kecai and Wang, Huaping},
  title   = {Rainbow numbers for small cycles},
  journal = {J. Math. Comput. Sci.},
  volume  = {8},
  year    = {2018},
  pages   = {297--303},
  doi     = {10.28919/jmcs/3629}
}