In graph theory, a branch of mathematics, the matching preclusion number of a graph G is the minimum number of edges whose deletion results in the elimination of all perfect matchings or near-perfect matchings.
Preferred languages to be displayed in the selection menus
Please note that, in order to improve your browsing experience on this website,
BabelNet® uses various types of cookies, including: browsing functionality,
performance and statistical cookies.
By continuing to browse the site you are agreeing to our use of cookies.
OK
