Degree sum conditions for the existence of homeomorphically irreducible spanning trees
- 12 August 2021
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 99 (1) , 162-170
Abstract
In 1990, Albertson, Berman, Hutchinson, and Thomassen proved a theorem which gives a minimum degree condition for the existence of a spanning tree with no vertices of degree 2. Such a spanning tree is called a homeomorphically irreducible spanning tree (HIST). In this paper, we prove that every graph of order ( ) contains a HIST if for any nonadjacent vertices and . The degree sum condition is best possible.
Keywords
This publication has 1 reference indexed in Scilit:
- Graphs with homeomorphically irreducible spanning treesJournal of Graph Theory, 1990