23 citations · 41 across the 4 of their papers we have counts for
1 paper · 2 filters
Július Czap, Jakub Przybyło, Erika Škrabuľáková
A graph G=(V,E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with presc…