Uniqueness and minimality of large face-width embeddings of graphs (Q1906851): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Densely embedded graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3921262 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial Local Planarity and the Width of Graph Embeddings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3972954 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Embeddings of graphs with no short noncontractible cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to Draw a Graph / rank | |||
Normal rank | |||
Latest revision as of 09:21, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness and minimality of large face-width embeddings of graphs |
scientific article |
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
