Spanning trees with bounded degrees and leaves

作者：Kano, Mikio; Yan, Zheng^*

来源：Discrete Mathematics, 2016, 339(5): 1583-1586.

DOI：10.1016/j.disc.2015.12.023

• Spanning tree
• Degree sum
• Independence number
• Leaf

Rivera-Campo provided a degree sum condition for a graph to have a spanning tree with bounded degrees and leaves. In this paper, we give an independence number condition for a graph to have a spanning tree with bounded degrees and leaves, which also partially solves the conjecture made by Enomoto and Ozeki (2010).

• 出版日期2016-5-6
• 单位长江大学