11 citations · 32 across the 7 of their papers we have counts for
1 paper · 1 filter
Dmitri Karpov
Let G be a bipartite graph without loops and multiple edges on v≥4 vertices, which can be drawn on the plane such that any edge intersects at most one other edge. We prove t…