12 citations · 39 across the 22 of their papers we have counts for
1 paper · 1 filter
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +6
A graph is k-planar (k≥1) if it can be drawn in the plane such that no edge is crossed more than k times. A graph is k-quasi planar (k≥2) if it can be drawn in…