Title of article :
Composite planar coverings of graphs Original Research Article
Author/Authors :
Seiya Negami، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
10
From page :
207
To page :
216
Abstract :
We shall prove that a connected graph G is projective-planar if and only if it has a 2n-fold planar connected covering obtained as a composition of an n-fold covering and a double covering for some n⩾1 and show that every planar regular covering of a nonplanar graph is such a composite covering.
Journal title :
Discrete Mathematics
Serial Year :
2003
Journal title :
Discrete Mathematics
Record number :
949180
Link To Document :
بازگشت