On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs

DOI10.1137/0403024zbMath0702.05031OpenAlexW2090030260MaRDI QIDQ3480059

Józef H. Przytycki, Teresa M. Przytycka

Publication date: 1990

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0403024

zbMATH Keywords

triangulationgraph embeddingclosed orientable surfacenoncontractible cyclen-vertex graph

Mathematics Subject Classification ID

Covering spaces and low-dimensional topology (57M10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Knots and Graphs: Two Centuries of Interaction ⋮ A simple construction of high representativity triangulations ⋮ Discrete systolic inequalities and decompositions of triangulated surfaces

This page was built for publication: On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs