Computing the Stretch of an Embedded Graph

DOI10.1137/130945636zbMath1305.05050OpenAlexW1991880818MaRDI QIDQ2935274

Markus Chimani, Petr Hliněný, Sergio Cabello

Publication date: 22 December 2014

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

Full work available at URL: https://idus.us.es/handle/11441/60027

zbMATH Keywords

crossingsembedded graphtopological graph theoryhomology basisnonseparating cycle

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Toroidal grid minors and stretch in embedded graphs

This page was built for publication: Computing the Stretch of an Embedded Graph