1 paper
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…