×

A note on connected factors in claw-free graphs. (English) Zbl 0980.05041

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.)
PDFBibTeX XMLCite