Applications
A blossom is a factor-critical subgraph of a larger graph. Blossoms play a key role in Jack Edmonds' algorithms for maximum matching and minimum weight perfect matching in non-bipartite graphs.
In polyhedral combinatorics, factor-critical graphs play an important role in describing facets of the matching polytope of a given graph.
Read more about this topic: Factor-critical Graph