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