1 paper
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki
A graph drawn on the plane is called 1-plane if each edge is crossed at most once by another edge. In this paper, we show that every 4-connected 1-plane graph has a connected…