5 papers · 1 filter
Another proof of the result on rotation compatible planar covers
Shohei Koizumi, Yusuke Suzuki, Kensuke Tamura
Negami's Planar Cover Conjecture asserts that a connected graph has a finite planar cover if and only if it can be embedded on the projective plane. While this statement has alread…
Linkage problem on optimal -planar graphs
Shohei Koizumi, Ryosuke Osaka, Yusuke Suzuki
Enami and Maezawa give a complete characterization of -linked planar graphs for any -tuple of positive integers. In this paper, we investigate linkage p…
The matching extendability of optimal -embedded graphs on the projective plane
Shohei Koizumi, Yusuke Suzuki
In this paper, we discuss matching extendability of optimal -projective plane graphs (abbreviated as O1PPG), which are drawn on the projective plane so that every edge cro…
Connectivity and matching extendability of optimal -embedded graphs on the torus
Shohei Koizumi, Yusuke Suzuki
In this paper, we discuss optimal -toroidal graphs (abbreviated as O1TG), which are drawn on the torus so that every edge crosses another edge at most once, and has vertices…
Spanning plane subgraphs of -plane graphs
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki
A graph drawn on the plane is called -plane if each edge is crossed at most once by another edge. In this paper, we show that every -connected -plane graph has a connected…