The matching extendability of optimal 2-planar graphs

Xinyao Li, Heping Zhang

A graph is 2-planar if it can be drawn in the plane such that each edge is crossed by at most two other edges. It is known that for a 2-planar graph $G$, $|E(G)|\le 5|V(G)|-10$.…