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

Weizhen Chen, Suonan Renqian, Qingcuo Ren, Xin Yan Li · International Journal of Computer Mathematics Computer Systems Theory · 2023

In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the {K2,Cn:n≥3}-factor and {P2,P3}-factor for any graph is obtained.

Read the paper · More papers on PaperTik