5 citations · 5 across the 6 of their papers we have counts for
1 paper · 1 filter
Tianlong Ma, Yaping Mao, Eddie Cheng +1
The \emph{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. A…