Bondy J A,Murty U S R.Graph theory with applications[M].London:Macmillan,Press Itd,1976.

Liu G,Zhang L.Toughness and the existence of fractional k-factor of graphs[J].Discrete Mathematics,2008,308:1741-1748.

Heinrich K,Hell P,Kirkpatrick D G,et al.A simple existence criterion for(g,f)-factor[J].Discrete Mathematics,1990,85:315-317.

Chen C.Binding number and minimum degree for[a,b]-factor[J].Journal of Systems Science and Mathematical Sciences,1993,6:179-185.

Lam P B C,Liu G,Li G,et al.Orthogonal(g,f)-factorizations in networks[J].Networks,2000,35:274-278.

Kano M,Matsuda H.A neighborhood condition for graphs to have[a,b]-factors,Proceedings of the 7th China-Japan conference on Discrete geometry,combinatorics and graph theory[C].Berlin:Springer-Verlag,Heidelberg,2007,70-78.

Liu G,Yu Q.k-factors and extendability with prescribed components[J].Congr Number,1999,139(1):77-88.

Egawa Y,Enomoto H.Sufficient conditions for the existence of k-factors,Recent Studies in Graph Theory[M].Vishwa International Publication,India,1989:96-105.

Katerinis P.Toughness of graphs and the existence of factors[J].Discrete Mathematics,1990,80:81-92.

Michitaka F,Takamasa Y.Neighborhood-union condition for an[a,b]-factor avoiding a specified Hamiltonian cycle[J].http://dx.doi.org/10.1016/j.disc.2016.09.026.