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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results