Claw-free graphs and 2-factors that sepa
✍
Ralph J. Faudree; Colton Magnant; Kenta Ozeki; Kiyoshi Yoshimoto
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 170 KB
## Abstract In this article, we prove that a line graph with minimum degree δ≥7 has a spanning subgraph in which every component is a clique of order at least three. This implies that if __G__ is a line graph with δ≥7, then for any independent set __S__ there is a 2‐factor of __G__ such that each c