Uniqueness and minimality of large face-width embeddings of graphs (Q1906851)
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: Uniqueness and minimality of large face-width embeddings of graphs |
scientific article; zbMATH DE number 837833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness and minimality of large face-width embeddings of graphs |
scientific article; zbMATH DE number 837833 |
Statements
Uniqueness and minimality of large face-width embeddings of graphs (English)
0 references
30 May 1996
0 references
This paper shows that if the face-width of the embedding of a graph \(G\) on a surface of genus \(g\) is at least \(c\log(g)/\log\log(g)\), then such an embedding is unique up to Whitney equivalence; see \textit{H. Whitney} [Am. Math. J. 55, 345-354 (1933; Zbl 0006.37005)].
0 references
face-width
0 references
embedding
0 references
surface
0 references
genus
0 references
Whitney equivalence
0 references
