1 research outputs found
Tight toughness, isolated toughness and binding number bounds for the -factors
The -factor of a graph is a spanning subgraph whose each
component is either or . In this paper, a sufficient condition with
regard to tight toughness, isolated toughness and binding number bounds to
guarantee the existence of the -factor for any
graph is obtained, which answers a problem due to Gao and Wang (J. Oper. Res.
Soc. China (2021), https://doi.org/10.1007/s40305-021-00357-6)