The maximum matching extendability and factor-criticality of 1-planar graphs

Jiangyue Zhang, Yan Wu, Heping Zhang

A graph is $1$-$planar$ if it can be drawn in the plane so that each edge is crossed by at most one other edge. Moreover, a 1-planar graph $G$ is $optimal$ if it satisfies $|E(G)|=…