The anti-Ramsey number Ar(G,H) is the maximum number of colors in an edge-coloring of G with no rainbow copy of H. In this paper, we determine the exact anti-Ramsey number in the generalized Petersen graph Pn,k for cycles Cd, where 1≤k≤⌊2n−1⌋ and 5≤d≤6. We also give an algorithm to obtain the upper bound or lower bound of anti-Ramsey number.
@article{arxiv.2110.01803,
title = {Anti-Ramsey problems in the generalized Petersen graphs for cycles},
author = {Huiqing Liu and Mei Lu and Shunzhe Zhang},
journal= {arXiv preprint arXiv:2110.01803},
year = {2021}
}