They may also be generalized from graphs to matroids.

Characterizing graph classes

Several important classes of graphs may be characterized as the graphs having certain types of ear decompositions.

Graph connectivity

A graph is ''k''-vertex-connected if the removal of any (k − 1) vertices leaves a connected subgraph, and ''k''-edge-connected if the removal of any (k − 1)