Geodesic
Anti-Ramsey numbers for graphs with independent cycles
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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ős 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.
DOI : 10.37236/174
Classification : 05C15, 05C38, 05C55
Mots-clés : rainbow graphs, anti Ramsey number, two independent cycles 
@article{10_37236_174,
     author = {Zemin Jin and Xueliang Li},
     title = {Anti-Ramsey numbers for graphs with independent cycles},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/174},
     zbl = {1186.05052},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/174/}
}
TY  - JOUR
AU  - Zemin Jin
AU  - Xueliang Li
TI  - Anti-Ramsey numbers for graphs with independent cycles
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/174/
DO  - 10.37236/174
ID  - 10_37236_174
ER  - 
%0 Journal Article
%A Zemin Jin
%A Xueliang Li
%T Anti-Ramsey numbers for graphs with independent cycles
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/174/
%R 10.37236/174
%F 10_37236_174
Zemin Jin; Xueliang Li. Anti-Ramsey numbers for graphs with independent cycles. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/174

Cité par Sources :