1 citations · 1 across the 9 of their papers we have counts for
1 paper · 1 filter
Saeed Odak, Jonathan Rollin, Torben Scheele
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…