Geodesic
Rainbow matchings in properly edge colored graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $G$ be a properly edge colored graph. A rainbow matching of $G$ is a matching in which no two edges have the same color. Let $\delta$ denote the minimum degree of $G$. We show that if $|V(G)|\geq \frac{8\delta}{5}$, then $G$ has a rainbow matching of size at least $\lfloor\frac {3 \delta }{5}\rfloor$. We also prove that if $G$ is a properly colored triangle-free graph, then $G$ has a rainbow matching of size at least $\lfloor\frac {2 \delta }{3}\rfloor$.
DOI : 10.37236/649
Classification : 05C15, 05C70
Mots-clés : rainbow matchings, properly colored graphs, triangle-free graphs 
@article{10_37236_649,
     author = {Guanghui Wang},
     title = {Rainbow matchings in properly edge colored graphs},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/649},
     zbl = {1230.05137},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/649/}
}
TY  - JOUR
AU  - Guanghui Wang
TI  - Rainbow matchings in properly edge colored graphs
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/649/
DO  - 10.37236/649
ID  - 10_37236_649
ER  - 
%0 Journal Article
%A Guanghui Wang
%T Rainbow matchings in properly edge colored graphs
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/649/
%R 10.37236/649
%F 10_37236_649
Guanghui Wang. Rainbow matchings in properly edge colored graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/649

Cité par Sources :