Rainbow number of matchings in Halin graphs
Abstract
The rainbow number rb(G,H) for the graph H in G is defined to be the minimum integer k such that any k-edge-coloring of G contains a rainbow H. As one of the most important structures in graphs, the rainbow number of matchings has drawn much attention and has been extensively studied. In this paper, we determine the rainbow number of some small matchings in Halin graphs.
Copyright © 2019 Lingyun Sang, Huaping Wang, Kun Ye. 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
L. Sang, H. Wang, K. Ye, Rainbow number of matchings in Halin graphs, J. Math. Comput. Sci. 9 (2019), 33–45. https://doi.org/10.28919/jmcs/3713
BibTeX
@article{Sang2019,
author = {Sang, Lingyun and Wang, Huaping and Ye, Kun},
title = {Rainbow number of matchings in Halin graphs},
journal = {J. Math. Comput. Sci.},
volume = {9},
year = {2019},
pages = {33--45},
doi = {10.28919/jmcs/3713}
}