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\geq 3\} $ {K2,Cn:n≥3}-factor and $ \{P_{2}, P_{3}\} $ {P2,P3}-factor for any graph is obtained.