Computing the anti-Ramsey number for trees in complete tripartite graph

Zemin Jin, Yite Wang, Huawei Ma and Huaping Wang

Applied Mathematics and Computation, 2023, vol. 456, issue C

Abstract: The anti-Ramsey number AR(K,F) is the largest color number in an edge-coloring of K that contains no rainbow copies of graphs in the family F. In this paper, we determine the exact value of the anti-Ramsey number for trees in a balanced complete tripartite graph.

Keywords: Anti-Ramsey number; Tree; Rainbow graph (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032300320X
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:456:y:2023:i:c:s009630032300320x

DOI: 10.1016/j.amc.2023.128151

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