Even [a,b]-factors in graphs
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 431-441

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

Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an even [a,b]-factor. The conditions are on the order and on the minimum degree, or on the edge-connectivity of the graph.
Keywords: even factor, eulerian, spanning subgraph
@article{DMGT_2004_24_3_a6,
     author = {Kouider, Mekkia and Vestergaard, Preben},
     title = {Even [a,b]-factors in graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {431--441},
     publisher = {mathdoc},
     volume = {24},
     number = {3},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a6/}
}
TY  - JOUR
AU  - Kouider, Mekkia
AU  - Vestergaard, Preben
TI  - Even [a,b]-factors in graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 431
EP  - 441
VL  - 24
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a6/
LA  - en
ID  - DMGT_2004_24_3_a6
ER  - 
%0 Journal Article
%A Kouider, Mekkia
%A Vestergaard, Preben
%T Even [a,b]-factors in graphs
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 431-441
%V 24
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a6/
%G en
%F DMGT_2004_24_3_a6
Kouider, Mekkia; Vestergaard, Preben. Even [a,b]-factors in graphs. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 431-441. http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a6/