Spanning Trees with At Most 6 Leaves in K1,5-Free Graphs
A graph G is called K1,5-free if G contains no K1,5 as an induced subgraph. A tree with at most m leaves is called an m-ended tree. Let σkG be the minimum degree sum of k independent vertices in G. In this paper, it is shown that every connected K1,5-free graph G contains a spanning 6-ended tree if σ7G≥G−2.
2019 ◽
Vol 28
(5)
◽
pp. 720-732
◽
Keyword(s):
Keyword(s):
2008 ◽
Vol 17
(1)
◽
pp. 111-136
◽
Keyword(s):
1992 ◽
Vol 104
(2)
◽
pp. 167-183
◽
2008 ◽
Vol 308
(17)
◽
pp. 3951-3959
◽
Keyword(s):