Title of article
Projective-planar double coverings of graphs
Author/Authors
Negami، نويسنده , , Seiya، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
14
From page
325
To page
338
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
Serial Year
2005
Journal title
European Journal of Combinatorics
Record number
1556429
Link To Document