vix.ing · top · new · best · stats

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs

2007/02/01 by Sergio Cabello, Bojan Mohar · 74 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Contractible space #Discrete mathematics #Face (sociological concept) #Geometry #Graph #Mathematics #Projective plane #Surface (topology)

paper · pdf · doi:10.1007/s00454-006-1292-5

published in Discrete & Computational Geometry 37(2), 213-235 (Springer Science+Business Media)

crossref issued 2007/02/01 · crossref published 2007/02/01 · crossref published-print 2007/02/01 · openalex publication_date 2007/02/01 · crossref created 2007/02/22 · crossref deposited 2019/05/28 · openalex created_date 2025/10/10 · crossref indexed 2026/05/12 · openalex updated_date 2026/07/23

Citations

Cited by