Shortest path embeddings of graphs on surfaces

DOI10.1007/s00454-017-9898-3zbMath1384.05073arXiv1602.06778OpenAlexW3125447510MaRDI QIDQ1688859

Vojtěch Kaluža, Alfredo Hubard, Arnaud de Mesmay, Martin Tancer

Publication date: 11 January 2018

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.06778

zbMATH Keywords

hyperbolic geometryshortest pathsgraph drawingembedded graphsFáry's theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces (53C23) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023 ⋮ Minimal Delaunay triangulations of hyperbolic surfaces

Uses Software

• CirclePack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Growth of Weil-Petersson volumes and random hyperbolic surface of large genus
• Pants decompositions of random surfaces
• Explicit bounds for graph minors
• Note on the irreducible triangulations of the Klein bottle
• Filling Riemannian manifolds
• An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
• How to change a triangulation of a surface into a geodesic triangulation?
• On the period matrix of a Riemann surface of large genus (with an appendix by J. H. Conway and N. J. A. Sloane)
• Irreducible triangulations of the Klein bottle
• The graph crossing number and its variants: a survey
• Discrete systolic inequalities and decompositions of triangulated surfaces
• Random construction of Riemann surfaces
• Untangling two systems of noncrossing curves
• Crossing numbers of graph embedding pairs on closed surfaces
• Two maps on one surface
• Embeddability in the 3-Sphere Is Decidable
• Foundations of Hyperbolic Manifolds
• Optimal pants decompositions and shortest homotopic cycles on an orientable surface
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• One-to-one piecewise linear mappings over triangulations
• Simultaneous Embedding of Planar Graphs with Few Bends
• Computing a canonical polygonal schema of an orientable triangulated surface
• Tightening Nonsimple Paths and Cycles on Surfaces
• Two maps with large representativity on one surface
• How to Draw a Graph

This page was built for publication: Shortest path embeddings of graphs on surfaces