Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs

For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G. Since a spanning 2-tree is a Hamiltonian path, a spanning k-tree is an extended concept of a Hamiltonian path. The first result, implying the e...

Full description

Bibliographic Details

Published in:	Discussiones Mathematicae Graph Theory
Main Authors:	Furuya Michitaka, Maezawa Shun-ichi, Matsubara Ryota, Matsuda Haruhide, Tsuchiya Shoichi, Yashima Takamasa
Format:	Article
Language:	English
Published:	University of Zielona Góra 2022-02-01
Subjects:	spanning tree k-tree star-free degree sum condition 05c05 05c50
Online Access:	https://doi.org/10.7151/dmgt.2234