Finding Cycles with Topological Properties in Embedded Graphs
DOI10.1137/100810794zbMath1237.05112OpenAlexW2082719291MaRDI QIDQ3225142
Francis Lazarus, Éric Colin de Verdière, Sergio Cabello
Publication date: 15 March 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100810794
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
This page was built for publication: Finding Cycles with Topological Properties in Embedded Graphs