Anti-Ramsey problems in the Mycielskian of a cycle

Wenjie Hu, Yibo Li, Huiqing Liu and Xiaolan Hu

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

Abstract: Let G and H be two graphs. The maximum integer k, for which there exists an edge coloring ϕ:E(G)→{1,2,…,k} that makes every copy of H has at least two edges with the same color, is the anti-Ramsey number of G with respect to H. Mycielski developed an interesting graph transformation that transforms G into the Mycielskian μ(G) of G. In this paper, we determine the anti-Ramsey number of μ(Cn) with respect to cycles of length 4, 2n and 2n+1, respectively.

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

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

DOI: 10.1016/j.amc.2023.128267

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