On essential and inessential polygons in embedded graphs
type: Item
instance of: scholarly article
title: On essential and inessential polygons in embedded graphs
zbMATH Open document ID: 1025.05016
author: R. B. Richter
author: Richard P. Vitray
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
review text: The authors present results of the type: A given subgraph of a graph imbedded in a surface is either imbedded in a disc or has a face chain containing a non-contractible closed path. One application is to show that any two faces of a 4-representative imbedding are simultaneously contained in a disc bounded by a polygon, and in turn to establish the existence, in an \(r\)-representative orientable imbedding, of \(\lfloor(r- 1)/8\rfloor\) pairwise disjoint, pairwise homotopic non-contractible separating polygons.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1843803
zbMATH Keywords: disc
zbMATH Keywords: face chain
zbMATH Keywords: orientable imbedding
reviewed by: Arthur T. White
MaRDI profile type: Publication
full work available at URL: jctb.2001.2065
OpenAlex ID: W1995705554
cites work: \(W_ v\) paths in the projective plane
cites work: W\({}_ V\) paths on the torus
cites work: Separating and nonseparating disjoint homotopic cycles in graph embeddings
cites work: Curves von 2-manifolds and isotopies
cites work: Computing the orientable genus of projective graphs
cites work: Combinatorial Local Planarity and the Width of Graph Embeddings
cites work: Q4064159
cites work: Non-revisiting paths on surfaces with low genus
cites work: Nonrevisiting paths on surfaces
cites work: Graph minors. VII: Disjoint paths on a surface
cites work: Q3972954
cites work: Disjoint circuits of prescribed homotopies in a graph on a compact surface
cites work: Q5524326
cites work: Q4273853
cites work: Q4273854
DOI: 10.1006/JCTB.2001.2065
description: scientific article; zbMATH DE number 1843803