 For instance, the friendship graphs, graphs formed from a collection of triangles joined together at a single shared vertex, are triangular cacti.As well as being cactus graphs the triangular cacti are also block graphs.The largest triangular cactus in any graph may be found in polynomial time using an algorithm for the matroid parity problem.