Some existence theorems on path-factor critical avoidable graphs

Sizhong Zhou, Hongxia Liu

A spanning subgraph $F$ of $G$ is called a path factor if every component of $F$ is a path of order at least 2. Let $k\ge 2$ be an integer. A $P_{\ge k}$-factor of $G$ means a pat…