On 2-Layer k-Matching-Planar Graphs

Abstract

A graph is $k$-matching-planar if it admits a drawing in the plane such that, for every edge $e$, the edges crossing $e$ contain no matching of size greater than $k$. The class of $k$-matching-planar graphs generalizes other beyond-planar graph classes, such as $k$-planar and fan-planar graphs. In a $2$-layer drawing of a bipartite graph, the vertices of the two bipartition classes are placed on two parallel horizontal lines and edges are drawn as straight-line segments between them. We prove that every graph with a $2$-layer $k$-matching-planar drawing has pathwidth at most $2k+1$. Moreover, for every $k\ge 0$, we construct a graph with a $2$-layer $k$-matching-planar drawing whose pathwidth is $3\lfloor k/2\rfloor +1$. On the algorithmic side, we consider the one-sided recognition problem where a fixed embedding of the vertices on one side is given. We show that this problem is NP-hard. On the other hand, we prove that the problem is fixed-parameter tractable with respect to $k$. Finally, we prove that the two-sided variant cannot be approximated within any constant factor in polynomial time unless $P=\mathrm{NP}$.

Accepted at GD2026