Article ID Journal Published Year Pages File Type
10118365 European Journal of Combinatorics 2005 14 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,