In topological graph theory, the graphs whose cellular embeddings are all planar are exactly the subfamily of the cactus graphs with the additional property that each vertex belongs to at most one cycle.
In topological graph theory, the graphs that have only planar embeddings are part of the subfamily of cactus graphs where each node is included in at most one loop.