Separating and nonseparating disjoint homotopic cycles in graph embeddings
type: Item
instance of: scholarly article
title: Separating and nonseparating disjoint homotopic cycles in graph embeddings
zbMATH Open document ID: 0855.05048
author: Richard Brunet
author: Bojan Mohar
author: R. B. Richter
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-10-14T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 934789
zbMATH Keywords: graph embedding
zbMATH Keywords: nonseparating cycles
zbMATH Keywords: noncontractible cycles
MaRDI profile type: Publication
OpenAlex ID: W2020053772
DOI: 10.1006/JCTB.1996.0016
Recommended article: Homogeneous embeddings of cycles in graphs
Recommended article: Q4349631
Recommended article: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
Recommended article: Algorithms – ESA 2005
Recommended article: On embedding well-separable graphs
Recommended article: Q3582097
Recommended article: Fundamental cycles and graph embeddings
Recommended article: Q4501701
Recommended article: Cyclic separability in graphs
Recommended article: Q4294583
description: scientific article; zbMATH DE number 934789