Unit distance graphs with few crossings per edge

Panna Gehér, Dömötör Pálvölgyi, Dániel G. Simon +1

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investig…