Composite planar coverings of graphs

Authors:
Seiya Negami
Affiliations:
Department of Mathematics, Faculty of Education and Human Sciences, Yokohama National University, 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan
Venue:
Discrete Mathematics
Year:
2003

Citing 5
Cited 1

Enumeration of projective-planar embeddings of graphs

Discrete Mathematics
Topological graph theory

Topological graph theory
On the parity of planar covers

Journal of Graph Theory
K4,4—e has no finite planar cover

Journal of Graph Theory
Two graphs without planar covers

Journal of Graph Theory

Projective-planar double coverings of graphs

European Journal of Combinatorics - Special issue: Topological graph theory II

Quantified Score

Hi-index	0.05

Visualization

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.