Component factors in $K_{1,r}$-free graphs

Guowei Dai, Zan-Bo Zhang, Xiaoyan Zhang

A graph is said to be $K_{1,r}$-free if it does not contain an induced subgraph isomorphic to $K_{1,r}$. An $\mathcal{F}$-factor is a spanning subgraph $H$ such that each connected…