Tight Toughness and Isolated Toughness for $\{K_2,C_n\}$-factor critical avoidable graph

Xiaxia Guan, Hongxia Ma, Maoqun Wang

A spannning subgraph $F$ of $G$ is a $\{K_2,C_n\}$-factor if each component of $F$ is either $K_2$ or $C_n$. A graph $G$ is called a $(\{K_2,C_n\},n)$-factor critical avoidable…