Re-embedding structures of 5-connected projective-planar graphs

Authors:
Shigeru Kitakubo;Seiya Negami
Affiliations:
Nippon Institute of Technology, Department of Systems Engineering, 4-1 Gakuendai, Miyashiro, Saitama 345-8501, Japan;Department of Mathematics, Faculty of Education and Human Sciences, Yokohama National University, 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan
Venue:
Discrete Mathematics - Algebraic and topological methods in graph theory
Year:
2002

Citing 2
Cited 0

Re-embedding of projective-planar graphs

Journal of Combinatorial Theory Series A
Bounding the number of embeddings of 5-connected projective-planar graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We shall identify the structures of 5-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane and show a short proof of the result, due to Kitakubo [3], that every 5-connected projective-planar nonplanar graph has exactly 1, 2, 3, 4, 6, 9 or 12 inequivalent embeddings on the projective plane.