Search

For a family of connected graphs ℱ , a spanning subgraph L of G is called an ℱ -factor if each component of L is isomorphic to a member of ℱ. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the { P 2 , C 3 , P 5 , (3) } -factor, P ≥ 2 -factor or { P 2 , C 2 i + 1 | i ≥ k } -factor for k ≥ 3 are obtained. [ABSTRACT FROM AUTHOR]