1 paper
Dickson Annor, Yuri Nikolayevsky, Michael Payne
A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is…