Is there an established name for graphs, that can be decomposed into

- a tree with at least three leaf nodes and
- a connected two-regular graph with the tree's leaf nodes as vertices?

examples of those graphs are the edge-graphs of polyhedra with one facet, that is edge-adjacent to all other facets.