A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth

Sergio Cabello, Alexander Dobler, Gašper Fijavž +2

A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to o…