The Existence of Spanning Ended System on Claw-Free Graphs

We prove that every connected claw-free graph G contains a spanning k-ended system if and only if cl(G) contains a spanning k-ended system, where cl(G) denotes Ryjáček closure of G