In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently...

Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi), but that name more properly refers to cactus graphs, graphs in which...

graph F2 is isomorphic to the butterfly graph. Friendship graphs are generalized by the triangular cactus graphs. The friendship theorem of Paul Erdős,...

In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing. Outerplanar...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

These include: Bipartite graph, a graph without odd cycles (cycles with an odd number of vertices) Cactus graph, a graph in which every nontrivial biconnected...

Cactus, alternative name of the Mammillaria cactus genera Cactus (crustacean), the crustacean genus Cactus graph or cactus, a type of connected graph...

in the graph shares at most one vertex. The family of graphs in which each connected component is a cactus graph is downwardly closed under graph minor...

distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict...

of graphs, including series–parallel graphs and their subgraphs, which include outerplanar graphs, as well as for a line graph of a tree or a cactus graph...