In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction on the order of graphs.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1355,
author = {Abdollah Khodkar and Rui Xu},
title = {More on even [a,b]-factors in graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {27},
year = {2007},
pages = {193-204},
zbl = {1133.05054},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1355}
}
Abdollah Khodkar; Rui Xu. More on even [a,b]-factors in graphs. Discussiones Mathematicae Graph Theory, Tome 27 (2007) pp. 193-204. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1355/
[000] [1] M.-C. Cai, On some factor theorems of graphs, Discrete Math. 98 (1991) 223-229, doi: 10.1016/0012-365X(91)90378-F. | Zbl 0758.05073
[001] [2] M. Kouider and P.D. Vestergaard, On even [2,b] -factors in graphs, Australasian J. Combin. 27 (2003) 139-147. | Zbl 1026.05092
[002] [3] M. Kouider and P.D. Vestergaard, Even [a,b] -factors in graphs, Discuss. Math. Graph Theory 24 (2004) 431-441, doi: 10.7151/dmgt.1242. | Zbl 1063.05109
[003] [4] M. Kouider and P.D. Vestergaard, Connected factors in graphs - a survey, Graphs and Combin. 21 (2005) 1-26, doi: 10.1007/s00373-004-0587-7. | Zbl 1066.05110
[004] [5] L. Lovász, Subgraphs with prescribed valencies, J. Combin. Theory 8 (1970) 391-416, doi: 10.1016/S0021-9800(70)80033-3. | Zbl 0198.29201
[005] [6] D.B. West, Introduction to Graph Theory (Prentice-Hall, Inc, 2000).