Joins of 1-planar graphs

Július Czap, Dávid Hudák, Tomáš Madaras

A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the joi…