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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2016-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2016/6041841 |