Homeomorphically irreducible spanning trees

Authors:
Guantao Chen;Songling Shan
Affiliations:
-;-
Venue:
Journal of Combinatorial Theory Series B
Year:
2013

Citing 3
Cited 0

Graphs with homeomorphically irreducible spanning trees

Journal of Graph Theory
Graph Theory

Graph Theory
Homeomorphically irreducible spanning trees in locally connected graphs

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that if G is a graph such that every edge is in at least two triangles, then G contains a spanning tree with no vertex of degree 2 (a homeomorphically irreducible spanning tree). This result was originally asked in a question format by Albertson, Berman, Hutchinson, and Thomassen in 1979, and then conjectured to be true by Archdeacon in 2009.