In 1988 Rafla conjectured that every simple drawing of a complete graph ...
A graph is 2-planar if it has local crossing number two, that is, it can...
A drawing of a graph is fan-planar if the edges intersecting a common ed...
Many problems in Discrete and Computational Geometry deal with simple
po...
Every finite graph admits a simple (topological) drawing, that is, a
dra...
We present fixed parameter tractable algorithms for the conflict-free
co...