On Homeomorphically Irreducible Spanning Trees in Cubic Graphs
Combinatorics
2017-06-13 v2
Abstract
A spanning tree without a vertex of degree two is called a Hist which is an abbreviation for homeomorphically irreducible spanning tree. We provide a necessary condition for the existence of a Hist in a cubic graph. As one consequence, we answer affirmatively an open question on Hists by Albertson, Berman, Hutchinson and Thomassen.
Keywords
Cite
@article{arxiv.1507.07689,
title = {On Homeomorphically Irreducible Spanning Trees in Cubic Graphs},
author = {Arthur Hoffmann-Ostenhof and Kenta Noguchi and Kenta Ozeki},
journal= {arXiv preprint arXiv:1507.07689},
year = {2017}
}