A Sufficient Condition for a Graph to Have a k-tree

被引：0
|
作者：
Aung Kyaw
机构：
[1] Department of Mathematics,
[2] University of Yangon,undefined
[3] Yangon 1104,undefined
[4] Myanmar,undefined
来源：
Graphs and Combinatorics | 2001年 / 17卷
关键词：
Early Result; Span Tree; Connected Graph; Maximum Degree; Maximal Order;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
 A k-tree of a connected graph is a spanning tree with maximum degree at most k. We obtain a sufficient condition for a graph to have a k-tree, as a generalization of the condition of E. Flandrin, H. A. Jung and H. Li [3] for traceability. We also extend early results of Y. Caro, I. Krasikov and Y. Roditty [2] and Min Aung and Aung Kyaw [4] for the maximal order of a tree with bounded maximum degree in a graph.
引用
收藏
页码：113 / 121
页数：8
相关论文
共 50 条
12345