Spanning 3-Ended Trees in Almost Claw-Free Graphs
We prove that if G is a k-connected (k≥2) almost claw-free graph of order n and σk+3(G)≥n+2k-2, then G contains a spanning 3-ended tree, where σk(G)=min{∑v∈Sdeg(v):S is an independent set of G with S=k}.
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2015/476182 |