Graphs with homeomorphically irreducible spanning trees

By a graph G we mean here a linear network, at least 3-connected with no vertices of degree 2, no multiple edges and no loops. A graph T is called a spanning graph of G provided (i) T is a tree, (ii) T is a subgraph of G and (iii) every vertex of G belongs to T.