A spanning k-spider in a graph.

Ryota Matsubara,Haruhide Matsuda,Hajime Matsumura

ARS COMBINATORIA（2018）

引用 23|浏览6

暂无评分

摘要

A spider is a rooted tree in which each vertex has degree one or two, except for the root. Moreover, for an integer k >= 2, a k-spider is a spider where the root has degree at most k. This paper gives degree conditions for a graph to have a spanning k-spider.

查看译文

关键词

spanning tree,spider,k-spider,degree condition

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要