Abstract
Let a, b, be two even integers. In this paper, we get a sufficient condition which involves the stability number, the minimum degree of the graph for the existence of an even [a, b]-factor.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Akiyama J., Kano M.: Factors and factorizations of graphs, a survey. J. Graph Theory 9, 1–42 (1985)
Cai J., Liu G., Hou J.: The stability number and connected [k, k + 1]-factor in graphs. Appl. Math. Lett. 22(6), 927–931 (2009)
Kano M.: An Ore-type sufficient condition for a graph to have a connected [2, k]-factor, (preprint)
Katerinis P., Tsikopoulos N.: Independence number, connectivity and f-factors. Utilitas Math 57, 81–95 (2000)
Kouider M., Lonc Z.: Stability number and [a, b]-factors in graphs. J. Graph Theory 46(4), 254–264 (2004)
Kouider M., Ouatiki S.: Stability number and even [2,b]-factors in graphs. AKCE J. Graphs Combin. 7(2), 151–169 (2010)
Kouider M., Vestergaard P.D.: On even [2, b]-factors in graphs. Aust. J. Combin. 27, 139–147 (2003)
Kouider M., Vestergaard P.D.: Even [a, b]-factors in graphs. Disc. Math. Graph Theory 24, 431–441 (2004)
Kouider M., Vestergaard P.D.: Connected factors in graphs, a survey. Graphs Combin. 21, 1–26 (2005)
Lovász L.: Subgraphs with prescribed valencies. J. Combin. Theory 9, 391–416 (1970)
Neumann-Lara V., Rivera-Campo E.: Spanning trees with bounded degrees. Combinatorica 11(1), 55–61 (1991)
Nishimura T.: Independence number, connectivity, and r-factors. J Graph Theory 13(1), 63–69 (1989)
Plummer M.D.: Graph factors and factorization, a survey. Discret. Math. 307(7–8), 791–821 (2007)
Tutte W.T.: Graph factors. Combinatorica 1, 70–97 (1981)
Zhou S.: Indepenpdence number connectivity and (a, b, k)-critical graphs. Discret. Math. 309(12), 4144–4148 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kouider, M., Ouatiki, S. Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. Graphs and Combinatorics 29, 1051–1057 (2013). https://doi.org/10.1007/s00373-012-1168-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1168-9