Geodesic
Disjoint 5-cycles in a graph
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 221-242

Voir la notice de l'article provenant de la source Library of Science

We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.
Keywords: 5-cycles, pentagons, cycles, cycle coverings 
@article{DMGT_2012_32_2_a2,
     author = {Wang, Hong},
     title = {Disjoint 5-cycles in a graph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {221--242},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a2/}
}
TY  - JOUR
AU  - Wang, Hong
TI  - Disjoint 5-cycles in a graph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 221
EP  - 242
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a2/
LA  - en
ID  - DMGT_2012_32_2_a2
ER  - 
%0 Journal Article
%A Wang, Hong
%T Disjoint 5-cycles in a graph
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 221-242
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a2/
%G en
%F DMGT_2012_32_2_a2
Wang, Hong. Disjoint 5-cycles in a graph. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 221-242. http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a2/