Title of article :
Projective-planar double coverings of graphs
Author/Authors :
Negami، نويسنده , , Seiya، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Abstract :
We shall show that a connected graph G is projective-planar if and only if it has a projective-planar double covering and that any projective-planar double covering of a 2-connected nonplanar graph is planar.
Journal title :
European Journal of Combinatorics
Journal title :
European Journal of Combinatorics