| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656963 | Journal of Combinatorial Theory, Series B | 2013 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
