@article{9dd7c9292ade438590f6a78dbf9ae31a,
title = "A spanning k-spider in a graph",
abstract = "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.",
keywords = "Degree condition, K-spider, Spanning tree, Spider",
author = "Ryota Matsubara and Haruhide Matsuda and Hajime Matsumura",
note = "Publisher Copyright: {\textcopyright} 2018 Charles Babbage Research Centre. All rights reserved.",
year = "2018",
month = jan,
language = "English",
volume = "136",
pages = "247--253",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",
}