Minimal obstructions for 1-immersions and hardness of 1-planarity testing

Vladimir P. Korzhik, Bojan Mohar

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar gra…