Some rainbow cycles in r-good edge-colorings

Zi-Long Liu and Fang Tian

Applied Mathematics and Computation, 2019, vol. 362, issue C, -

Abstract: Let Gϕ be an edge-colored graph with order n and δGϕ be the smallest number of distinctly colored edges incident to a vertex of Gϕ. To determine the smallest function h(n) such that any edge-colored graph Gϕ of order n contains a rainbow cycle if δGϕ≥h(n)? It is known that log2nKeywords: Rainbow cycles; Color degree; r-good edge-coloring; Extremal problems (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305491
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:362:y:2019:i:c:26

DOI: 10.1016/j.amc.2019.124566

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 ().