Geodesic
Partitions of a graph into cycles containing a specified linear forest
Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 1, pp. 97-107

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

In this note, we consider the partition of a graph into cycles containing a specified linear forest. Minimum degree and degree sum conditions are given, which are best possible.
Keywords: partition of a graph, vertex-disjoint cycle, 2-factor, linear forest 
@article{DMGT_2008_28_1_a6,
     author = {Matsubara, Ryota and Matsumura, Hajime},
     title = {Partitions of a graph into cycles containing a specified linear forest},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {97--107},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a6/}
}
TY  - JOUR
AU  - Matsubara, Ryota
AU  - Matsumura, Hajime
TI  - Partitions of a graph into cycles containing a specified linear forest
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2008
SP  - 97
EP  - 107
VL  - 28
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a6/
LA  - en
ID  - DMGT_2008_28_1_a6
ER  - 
%0 Journal Article
%A Matsubara, Ryota
%A Matsumura, Hajime
%T Partitions of a graph into cycles containing a specified linear forest
%J Discussiones Mathematicae. Graph Theory
%D 2008
%P 97-107
%V 28
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a6/
%G en
%F DMGT_2008_28_1_a6
Matsubara, Ryota; Matsumura, Hajime. Partitions of a graph into cycles containing a specified linear forest. Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 1, pp. 97-107. http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a6/