Some sufficient conditions for path-factor uniform graphs

Sizhong Zhou, Zhiren Sun, Hongxia Liu

For a set $\mathcal{H}$ of connected graphs, a spanning subgraph $H$ of $G$ is called an $\mathcal{H}$-factor of $G$ if each component of $H$ is isomorphic to an element of $\mathc…