2 papers
cs.CG2026
On 2-Layer k-Matching-Planar Graphs
Saeed Odak, Jonathan Rollin, Torben Scheele
A graph is -matching-planar if it admits a drawing in the plane such that, for every edge , the edges crossing contain no matching of size greater than . The class of…
cs.CG2025
On plane cycles in geometric multipartite graphs
Marco Ricci, Jonathan Rollin, André Schulz +1
A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints…