{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T18:08:00Z","timestamp":1777745280487,"version":"3.51.4"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let ${\\cal G}$ be a family of graphs. The anti-Ramsey number $AR(n,{\\cal G})$ for ${\\cal G}$,  introduced by Erd\u0151s et al.,  is the maximum number of colors in an edge coloring of $K_n$ that has no rainbow copy of any graph in ${\\cal G}$. In this paper, we determine the anti-Ramsey number $AR(n,\\Omega_2)$, where $\\Omega_2$ denotes the family of graphs that contain two independent cycles.<\/jats:p>","DOI":"10.37236\/174","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:28:26Z","timestamp":1578716906000},"source":"Crossref","is-referenced-by-count":19,"title":["Anti-Ramsey Numbers for Graphs with Independent Cycles"],"prefix":"10.37236","volume":"16","author":[{"given":"Zemin","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2009,7,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r85\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r85\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T02:50:29Z","timestamp":1579315829000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1r85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,9]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/174","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,9]]},"article-number":"R85"}}