On HISTs in Cubic Graphs
Arthur Hoffmann‐Ostenhof, Kenta Ozeki · arXiv (Cornell University) · 2015
A HIST of a connected graph is a spanning tree without vertices of degree two. We provide a necessary condition for the existence of a HIST in cubic graphs. As one consequence, we answer affirmatively an open question on HISTs by Albertson, Berman, Hutchinson and Thomassen.