Matching preclusion for $n$-grid graphs

Qi Ding, Heping Zhang, Hui Zhou

A matching preclusion set of a graph is an edge set whose deletion results in a graph without perfect matching or almost perfect matching. The Cartesian product of $n$ paths is cal…