A sufficient condition for a graph to have a \(k\)-tree (Q5936096)

A classical theorem of Ore says that a graph \(G= (V,E)\) with the property that the sum of the degrees of each pair of non-adjacent vertices is at least \(|V|-1\) has a Hamilton path. Such a path is just a spanning tree for \(G\) with maximum degree 2. A spanning tree with maximum degree \(k\) is called a \(k\)-tree. The paper discusses generalizations of Ore's theorem and obtains a sufficient condition for a graph to have a \(k\)-tree.