Spanning 3-ended trees in k-connected K (1,4)-free graphs

作者：Chen Yuan^*; Chen GuanTao; Hu ZhiQuan

来源：Science China Mathematics, 2014, 57(8): 1579-1586.

DOI：10.1007/s11425-014-4817-z

• spanning tree
• degree sum
• insertible vertex
• segment insertion

A tree with atmost m leaves is called an m-ended tree. Kyaw proved that every connected K (1,4)-free graph with sigma (4)(G) a (c) 1/2 n-1 contains a spanning 3-ended tree. In this paper we obtain a result for k-

• 出版日期2014-8
• 单位华中师范大学; 武汉纺织大学