2000 character limit reached
On Homeomorphically Irreducible Spanning Trees in Cubic Graphs (1507.07689v2)
Published 28 Jul 2015 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.