On essential and inessential polygons in embedded graphs (Q1850578)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On essential and inessential polygons in embedded graphs |
scientific article; zbMATH DE number 1843803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On essential and inessential polygons in embedded graphs |
scientific article; zbMATH DE number 1843803 |
Statements
On essential and inessential polygons in embedded graphs (English)
0 references
10 December 2002
0 references
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.
0 references
disc
0 references
face chain
0 references
orientable imbedding
0 references