Rainbow numbers for small graphs in planar graphs

Zhongmei Qin, Hui Lei and Shasha Li

Applied Mathematics and Computation, 2020, vol. 371, issue C

Abstract: Let G be a family of graphs and H be a subgraph of at least one of the graphs in G. The rainbow number for H with respect to G, denoted rb(G,H), is the minimum number k such that, if H⊆G∈G, then any k-edge-coloring of G contains a rainbow H (i.e., any two edges of H are colored distinct). Denote by Tn the class of all plane triangulations of order n and Wd the wheel graph of order d+1. In this paper, we determine the exact rainbow numbers for matchings and a triangle with one or two pendant edges with respect to Wd, and the exact rainbow numbers for the triangle with one pendant edge with respect to Tn. Furthermore, we give upper bounds of rainbow numbers for triangles with two pendant edges with respect to Tn.

Keywords: Rainbow number; Anti-Ramsey number; Plane triangulation; Wheel graph (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031930880X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:371:y:2020:i:c:s009630031930880x

DOI: 10.1016/j.amc.2019.124888

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().