Homeomorphically Irreducible Spanning Trees (Hists)

• Hists are spanning trees without degree-two vertices, ensuring each vertex is either a leaf or a branch point, which is crucial in defining the tree structure of graphs.
• They establish key numerical relationships (e.g., t1 = |V(G)|/2 + 1 and t3 = |V(G)|/2 - 1) that highlight necessary obstructions and conditions in cubic graphs.
• The study of Hists informs theoretical decompositions and algorithmic approaches in graph theory, impacting extremal characterizations and practical designs in regular graphs.

A homeomorphically irreducible spanning tree (Hist) is a spanning tree of a graph in which no vertex has degree exactly two; equivalently, all vertex degrees in the tree are either one or at least three. In the context of cubic graphs, Hists play a central role in both structural decomposition and extremal characterizations. The necessary conditions for the existence of a Hist in a cubic graph are particularly restrictive and provide clear obstructions in several important graph classes.

1. Definition and Basic Properties

Let $G$ be a connected graph. A spanning tree $T \subseteq G$ is termed a homeomorphically irreducible spanning tree (Hist) if $\deg_T(v) \neq 2$ for every vertex $v \in V(T)$. In the case where $G$ is cubic, i.e., every vertex has degree three, a Hist $T$ must satisfy $\deg_T(v) \in \{1,3\}$ for all $v$ (Hoffmann-Ostenhof et al., 2015).

For cubic graphs, a Hist $T$ partitions the vertex set into leaves (degree 1 in $T$) and branch vertices (degree 3 in $T$). These structural properties yield strong numerical relationships: $t_1 + t_3 = |V(G)| \ t_1 + 3t_3 = 2(|V(G)| - 1)$ Solving, one obtains $t_1 = |V(G)|/2 + 1$, $t_3 = |V(G)|/2 - 1$.

A spanning tree with these properties is the irreducible core of any tree under edge contraction of degree-2 vertices.

2. Decomposition and Necessary Condition in Cubic Graphs

A central necessary condition for the existence of a Hist in a cubic graph is given as follows (Hoffmann-Ostenhof et al., 2015):

Let $T$ be a Hist in a cubic graph $G$, and let $H := \langle E(G) \setminus E(T) \rangle$, i.e., the subgraph induced by the complement of the tree edges. Then:

1. $H$ is a non-separating 2-regular subgraph of $G$. That is, $H$ is a union of chordless cycles, and removing its edges leaves $G - E(H) = T$, which is connected.
2. $|V(H)| = |V(G)|/2 + 1$.

Furthermore, for bipartite cubic graphs, the existence of a Hist imposes the congruence condition $|V(G)| \equiv 2 \pmod{4}$ (Hoffmann-Ostenhof et al., 2015).

3. Structural Implications and Examples

These necessary conditions immediately yield broad structural obstructions. For instance, if a bipartite cubic graph has order divisible by 4, it admits no Hist (Hoffmann-Ostenhof et al., 2015). Similarly, many fullerene graphs of small order, such as the dodecahedron (20 vertices), cannot accommodate a non-separating 2-regular subgraph on $|V(G)|/2 + 1 = 11$ vertices, hence have no Hist.

Examples of graphs admitting a Hist include:

• $K_4$: A $K_{1,3}$ star is a Hist.
• Cubic Halin graphs: A plane tree with no vertex of degree 2, plus a cycle through its leaves.
• Certain fullerenes and toroidal regular hexangulations (Hoffmann-Ostenhof et al., 2015).

Conversely, infinite families of bipartite cubic graphs, constructed via the "inflation" procedure replacing vertices of a 4d-regular base graph by cycles, yield cyclically k-edge-connected bipartite cubic graphs of order $0 \pmod{4}$ that have no Hist. This construction conclusively answered an open problem posed by Albertson, Berman, Hutchinson, and Thomassen (Hoffmann-Ostenhof et al., 2015).

4. Broader Implications and Relationships

The necessary condition involving the non-separating 2-regular subgraph provides a template for analyzing not only cubic graphs but also higher regularity. The inflation and counting arguments suggest corresponding investigations for quartic (4-regular) and higher-regular graphs. In planar graphs, further local structure can be extracted: the complement 2-regular subgraph in a planar cubic graph with a Hist can be taken to consist of facial cycles, which in turn gives rapid obstructions to Hists in certain classes of fullerenes (Hoffmann-Ostenhof et al., 2015).

On surfaces of higher genus (e.g., the torus), infinite families of cubic hexangulations can be constructed with or without Hists, depending on congruence obstructions in the bipartite case.

5. Applications to Extremal and Algorithmic Graph Theory

The necessary conditions have algorithmic implications: for cubic graphs, searching for a Hist can be recast as searching for an appropriate non-separating 2-regular subgraph. Structural results derived from these conditions contribute both to the theory of exceptional graphs (such as snarks, i.e., non-3-edge-colorable cyclically 4-edge-connected cubic graphs) and to algorithms for recognizing Hists in regular graphs.

Additionally, these results ground recent advances in the study of decompositions of cubic graphs, such as the 3-decomposition conjecture where every cubic graph is conjectured to admit a decomposition into a spanning tree, a 2-regular subgraph (union of cycles), and a matching, with the irreducible core of such decompositions being a Hist (Bachtler et al., 2021).

6. Examples Table

A summary of key graph families with respect to the existence of Hists:

Graph Type	HIST Exists?	Explanation
$K_4$, cubic Halin, some fullerene	Yes	Have a spanning tree with all degrees 1 or 3
Bipartite cubic, $|V| \equiv 0 \pmod 4$	No	Fails $|V| \equiv 2 \pmod 4$ congruence
Dodecahedron, Buckminster fullerene	No	Cannot support required non-separating 2-regular subgraph

For cyclically k-edge-connected cubic graphs (including snarks), the inflation method gives infinite families without Hists for each $k$.

7. Generalizations and Open Problems

These constraints highlight that the existence of Hists in cubic (and higher-degree) graphs is governed by deep arithmetic and topological properties, with the non-separating 2-regular subgraph and the order modulo 4 as critical parameters. The structure extends naturally via inflation to regular graphs of larger degree, with open problems concerning the classification of all such graphs that admit Hists and the interplay between underlying symmetry, bipartition, and cycle structures.

The characterization and construction of higher genus or high-connectivity cubic graphs with or without Hists remain active areas of research, as does the boundary of necessary and sufficient conditions that guarantee the existence of Hists in broader regular families (Hoffmann-Ostenhof et al., 2015).