A sufficient condition for a graph to have a \(k\)-tree (Q5936096): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s003730170059 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002082255 / rank | |||
Normal rank | |||
Latest revision as of 00:46, 20 March 2024
scientific article; zbMATH DE number 1612990
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for a graph to have a \(k\)-tree |
scientific article; zbMATH DE number 1612990 |
Statements
A sufficient condition for a graph to have a \(k\)-tree (English)
0 references
28 August 2002
0 references
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.
0 references
Hamilton path
0 references
spanning tree
0 references
