Xu, Baoguang; Liu, Zhenhong A note on connected factors in claw-free graphs. (English) Zbl 0980.05041 J. Syst. Sci. Complex. 14, No. 1, 91-92 (2001). Summary: It is shown that every connected claw-free graph contains connected \([a,\max\{a+ 2,b\}]\)-factors if it has \([a,b]\)-factors, where \(a\), \(b\) are integers and \(b\geq a\geq 1\). MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:connected factors; claw-free graph PDFBibTeX XMLCite \textit{B. Xu} and \textit{Z. Liu}, J. Syst. Sci. Complex. 14, No. 1, 91--92 (2001; Zbl 0980.05041)