Separating and nonseparating disjoint homotopic cycles in graph embeddings

DOI10.1006/jctb.1996.0016zbMath0855.05048OpenAlexW2020053772MaRDI QIDQ1924122

Bojan Mohar, Richard Brunet, R. Bruce Richter

Publication date: 14 October 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4cca39ecc6753110df6ea949dfde926278bc9ad1

zbMATH Keywords

graph embeddingnoncontractible cyclesnonseparating cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Unnamed Item, A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface, Bounded face-width forces \(K_7\)-minors in orientable surfaces, Some recent progress and applications in graph minor theory, Approximation Algorithms for Euler Genus and Related Problems, Approximation algorithms via contraction decomposition, Approximating the Crossing Number of Toroidal Graphs, Random graphs on surfaces, Odd complete minors in even embeddings on surfaces, Chromatic numbers of quadrangulations on closed surfaces, Toroidal grid minors and stretch in embedded graphs, Coloring-flow duality of embedded graphs, On essential and inessential polygons in embedded graphs