Matching preclusion examines the resilience of a network modelled as a graph by identifying the smallest set of edge removals that destroys all perfect matchings. Originating in the study of ...