Tight toughness, isolated toughness and binding number bounds for the \K2,Cn\-factors
Abstract
The \K2,Cn\-factor of a graph is a spanning subgraph whose each component is either K2 or Cn. In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the \K2,C2i+1| i≥ 2 \-factor for any graph is obtained, which answers a problem due to Gao and Wang (J. Oper. Res. Soc. China (2021), https://doi.org/10.1007/s40305-021-00357-6).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.