Tight toughness, isolated toughness and binding number bounds for the path factors
Yue Li, Fengyun Ren, Xin Xu, Qinghe Tong · International Journal of Computer Mathematics Computer Systems Theory · 2023
For a set X of connected subgraphs, an X-factor denotes a spanning subgraph D of G if each component of D is isomorphic to a member of X. In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the {P2,P7}-factor and {P2,P9}-factor for a graph are obtained.