Separating and nonseparating disjoint homotopic cycles in graph embeddings (Q1924122)
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: Separating and nonseparating disjoint homotopic cycles in graph embeddings |
scientific article; zbMATH DE number 934789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating and nonseparating disjoint homotopic cycles in graph embeddings |
scientific article; zbMATH DE number 934789 |
Statements
Separating and nonseparating disjoint homotopic cycles in graph embeddings (English)
0 references
14 October 1996
0 references
We show that if a graph \(G\) is embedded in a surface \(\Sigma\) with representativity \(\rho\), then \(G\) contains at least \(\lfloor(\rho- 1)/2\rfloor\) pairwise disjoint, pairwise homotopic, nonseparating (in \(\Sigma\)) cycles, and \(G\) contains at least \(\lfloor(\rho- 1)/8\rfloor- 1\) pairwise disjoint, pairwise homotopic, separating, noncontractible cycles.
0 references
graph embedding
0 references
nonseparating cycles
0 references
noncontractible cycles
0 references
0.91481054
0 references
0.8923471
0 references
0 references
0.8868504
0 references
0 references
