A Concise Survey of Matching Preclusion in Interconnection Networks
Yaping Mao, Eddie Cheng · Journal of Interconnection Networks · 2019
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion number, and so on. In this survey, we give an introduction on the general topic of matching preclusion.