On a New Conclusions for k-Factors in Graphs
Huang Guang-xin · 2002
A k-factors of G is a k-regular spanning subgraph. A sufficient condition of a graph which has k-factors is first shown in the paper,namely if G is a simple graph,v is even and 2/)(vGd )2(-+k,here integer 3k,then G has k-factors. Thus a conclusion in reference book [1] is generalized .At last a relative conclusion is drawn.