10 citations · 10 across the 1 of their papers we have counts for
1 paper
Igor Fabrici, Jochen Harant, Tomáš Madaras +3
A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for e…