Sufficient size and spectral radius conditions are provided for connected t/(t(k-2)+1)-tough graphs to contain spanning k-trees, refining prior toughness thresholds for k ≥ 3.
Win, On a connection between the existence ofk-trees and the toughness of a graph, Graphs Combin
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sufficient conditions for spanning $k$-trees in tough graphs
Sufficient size and spectral radius conditions are provided for connected t/(t(k-2)+1)-tough graphs to contain spanning k-trees, refining prior toughness thresholds for k ≥ 3.