Finding one tight cycle

DOI10.1145/1824777.1824781zbMath1300.05071OpenAlexW2147508044MaRDI QIDQ2930343

Matt DeVos, Bojan Mohar, Sergio Cabello, Jeff Erickson

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1824777.1824781

zbMATH Keywords

topological graph theorycombinatorial surfacenoncontractible cyclenonseparating cycle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Fundamental group, presentations, free differential calculus (57M05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Minimum Cuts in Surface Graphs ⋮ Algorithms for the edge-width of an embedded graph ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Unnamed Item ⋮ Typical representatives of free homotopy classes in multi-punctured plane ⋮ Unnamed Item