A new strategy for finding spanning trees without small degree stems

DOI10.37236/13074MaRDI QIDQ6925690zbMATH OpenFDO

Authors Michitaka Furuya, Shoichi Tsuchiya

Publication date 25 September 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13074

zbMATH Keywords

homeomorphically irreducible spanning treespanning tree

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Cites work

• Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree
• Degree sum conditions for the existence of homeomorphically irreducible spanning trees
• Forbidden subgraphs and the existence of a spanning tree without small degree stems
• Graph theory
• Graphs with homeomorphically irreducible spanning trees
• Homeomorphically irreducible spanning trees
• Homeomorphically irreducible spanning trees in hexangulations of surfaces
• Homeomorphically irreducible spanning trees in locally connected graphs
• scientific article; zbMATH DE number 3346402 (Why is no real title available?)
• Note on Hamilton Circuits
• On homeomorphically irreducible spanning trees in cubic graphs
• Refinements of degree conditions for the existence of a spanning tree without small degree stems
• Some Theorems on Abstract Graphs

This page was built for publication: A new strategy for finding spanning trees without small degree stems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925690)