Tight toughness, isolated toughness and binding number bounds for the path-cycle factors

Abstract

In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the $\{K_2,C_n:n\ge 3\}$-factor and $\{P_2,P_3\}$-factor for any graph is obtained.

Keywords:

• Component factor
• toughness
• isolated toughness
• binding number
• path factor

AMS subject classification 2020:

• 05C42
• 05C38

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

Supported by the Qinghai Key Laboratory of Internet of Things Project [grant number 2017-ZJ-Y21].