Re-embedding of projective-planar graphs
type: Item
instance of: scholarly article
title: Re-embedding of projective-planar graphs
zbMATH Open document ID: 0609.05033
DOI: 10.1016/0095-8956(88)90037-8
author: Seiya Negami
published in: Journal of Combinatorial Theory. Series B
publication date: 1988-01-01T00:00:00Z
review text: Let G be a graph embedded in a surface \(F^ 2\). An embedding \(f: G\to F^ 2\) is called a re-embedding of G in \(F^ 2\) if f cannot extend to a self-homeomorphism \(h: F^ 2\to F^ 2\) with \(h| _ G=f\). In this paper, re-embeddings of 3-connected nonplanar graphs embedded in the projective plane are classified into five types with respect to how bridges for the boundary cycle of a face are re-embedded. This classification theorem, called Re-embedding Theorem, is used to show that 5-connected projective-planar graphs with a certain condition are uniquely and faithfully embeddable in the projective plane.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 3985250
zbMATH Keywords: projective planar graphs
zbMATH Keywords: embedding of graphs in surfaces
MaRDI profile type: Publication
full work available at URL: 0095-8956(88)90037-8
OpenAlex ID: W2049441076
cites work: Uniqueness and faithfulness of embedding of toroidal graphs
cites work: Unique and faithful embeddings of projective-planar graphs
cites work: Uniquely and faithfully embeddable projective-planar triangulations
description: scientific article; zbMATH DE number 3985250