Spanning trees with at most k leaves in K1, 4-free graphs
Spanning trees with at most k leaves in K1, 4-free graphs
复制标题
DOI：
10.1016/j.disc.2011.06.025
复制
发表时间：
2011-10
期刊：
影响因子：
--
通讯作者：
Aung Kyaw
中科院分区：
文献类型：
--
作者：
Aung Kyaw
本文给出了K1，4-free图具有至多k个叶子的生成树的一个充分条件，作为Kyaw [A. Kyaw，Spanning trees with at most 3 leaves in K1，4-free graphs，Discrete Math.309（2009）6146-6148]，以使K1，4-free graphs具有至多3个叶子的生成树。
We obtain a sufficient condition for K 1, 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, 4-free graphs, Discrete Math. 309 (2009) 6146–6148] for K 1, 4-free graphs to have spanning trees with at most 3 leaves.