References
- J. Akiyama and M. Kano, Factors and factorizations of graphs-A survey, J. Graph Theory, 9 (1985), 1–42.
- B. Bollobás, Graph Theory, An Introductory Course, Graduate texts in Mathematics, Springer-Verlag New York Inc., 1979.
- S. Brandt, Private communication.
- M. Kano, An Ore-type sufficient condition for a graph to have a connected [2, k]-factor (preprint).
- M. Kouider, Cycles in graphs with prescribed stability number and connectivity, J. Combin. Theory Series B, 60(2) (1994), 315–318.
- M. Kouider and M. Mahéo, Two edge connected [2, k]-factors in graphs, Combinatoria, 22(1) (2002), 71–82.
- M. Kouider and Z. Lonc, Stability Number and [a, b]-factors in graphs, Journal of Graph Theory, 46(4) (2004), 254–264.
- M. Kouider and P.D. Vestergaard, Connected factors in graphs-A survey, Graphs and Combinatorics, 21 (2005), 1–26.
- L. Lovász, Subgraphs with prescribed valencies, J Combin. Theory, 9 (1970), 391–416.
- V. Neumann-Lara, and E. Rivera-Campo, Spanning trees with bounded degrees, Combinatorica, 11 (1) (1991), 55–61.
- T. Nishimura, Independence number, connectivity, and r-factors, J. Graph Theory, 13(1) (1989), 63–69.
- M.D. Plummer, Graph factors and factorization-A survey, Discrete Math., 307(7-8) (2007), 791–821.
- W.T. Tutte, Graph factors, Combinatorica, 1 (1981), 70–97.
- D.B. West, Introduction to Graph Theory, Prentice-Hall, Inc. 1996.