Rainbow numbers for small cycles
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.
Full Text:
PDF
How to Cite this Article
Bihong Lv, Kecai Ye, Huaping Wang, Rainbow numbers for small cycles, J. Math. Comput. Sci., 8 (2018), 297-303. https://doi.org/10.28919/jmcs/3629
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.