Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
Home
Publications
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
Authors:
SC
Sergio Cabello
Sergio Cabello
BM
Bojan Mohar
Bojan Mohar
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Open Access
Publisher website
Google Scholar
1 February 2007
journal article
Published by
Springer Nature
in
Discrete & Computational Geometry
Vol. 37
(2)
,
213-235
DOI:
10.1007/s00454-006-1292-5
Abstract
No abstract available
Keywords
FINDING SHORTEST
TOPOLOGICALLY EMBEDDED
SHORTEST SURFACE
EMBEDDED
TOPOLOGICALLY
FINDING
SURFACE NON-SEPARATING
EMBEDDED GRAPHS
SURFACE
SHORTEST
Cited
Cited by 63 articles
Scroll to top