8 citations · 37 across the 25 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017★ 4 cited
On the Relationship between -Planar and -Quasi Planar Graphs
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +6
A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. A graph is -quasi planar if it can be drawn in…
cs.CG2017
On Planar Greedy Drawings of 3-Connected Planar Graphs
Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati
A graph drawing is if, for every ordered pair of vertices , there is a path from to such that the Euclidean distance to decreases monotonically…