Spanning trees with at most k leaves in K1,4-free graphs

被引：28

作者：

Kyaw, Aung ^{[1
]}

机构：

[1] Dugan Univ, Dept Math, Yangon 11422, Myanmar

来源：

DISCRETE MATHEMATICS | 2011年 / 311卷 / 20期

关键词：

Spanning tree; Leaf; Degree sum; K-1; K-4-free; Spanning t-ended system;

D O I：

10.1016/j.disc.2011.06.025

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We obtain a sufficient condition for K-1,K-4-free graphs to have spanning trees with at most k leaves, as a generalization of the condition of Kyaw [A. Kyaw, Spanning trees with at most 3 leaves in K-1,K-4-free graphs, Discrete Math. 309 (2009) 6146-6148] for K-1,K-4-free graphs to have spanning trees with at most 3 leaves. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：2135 / 2142

页数：8