Sufficient conditions for $k$-factors and spanning trees of graphs

Guoyan Ao, Ruifang Liu, Jinjiang Yuan +2

For any integer $k\ge 1,$ a graph $G$ has a $k$-factor if it contains a $k$-regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of $r$-c…