Tight toughness, isolated toughness and binding number bounds for the $\{K_2,C_n\}$-factors

Xiaxia Guan, Tianlong Ma, Chao Shi

The $\{K_2,C_n\}$-factor of a graph is a spanning subgraph whose each component is either $K_2$ or $C_n$. In this paper, a sufficient condition with regard to tight toughness, isol…