Preprint
Aug 2026
The matching extendability of optimal 2-planar graphs
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$. When the equality holds, we call $G$ an optimal 2-planar graph. This paper investigates the matching extendability of optimal 2-planar grap...
Xin-Yao Li, Heping Zhang
· 0 citations