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/}
}
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/