[a,b]-factor of graphs
MA Yue-fei, Wei Wang, Gong Yang-long, Hit Shenzhen · jOURNAL OF southwest University for Nationalities · 2006
A spanning subgraph F of graph G is called a[a,b] -factor,if v∈V,satisfying a≤d~F(v)≤b,wherea a≤b is nonnegative integer.Firstly,by the Hall theorem,it gives a sufficient condition for a graph G to have factor.After that,associated with the Lovasz Theorem,it shows some relationships between the factor of G and the factor of subgraph of G,and induces a criterion for a [a,b]-factor to be a minimal factor.