Separating and nonseparating disjoint homotopic cycles in graph embeddings
From MaRDI portal
Publication:1924122
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
Related Items (13)
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
This page was built for publication: Separating and nonseparating disjoint homotopic cycles in graph embeddings