This research explores the existence of homeomorphically irreducible spanning trees in small graphs, indicating new insights into graph theory.
For a graph G, a spanning tree with no vertices of degree 2 is called a homeomorphically irreducible spanning tree (HIST). In some theorems for the existence of a HIST, small graphs are dealt with exceptions. In this paper, we investigate small graphs to have a HIST.
No takes yet. Share an insight, caveat, or question.
Ito et al. (2020) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: