Drawing Shortest Paths in Geodetic Graphs

DOI10.1007/978-3-030-68766-3_26OpenAlexW3127208467MaRDI QIDQ5014127

No author found.

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

geodetic graphsedge crossingsunique shortest paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
• Geodetic graphs of diameter two and some related structures
• Some general constructions of geodetic blocks
• Which crossing number is it anyway?
• On Moore Graphs with Diameters 2 and 3
• Euclidean shortest paths in the presence of rectilinear barriers
• On the Structure of Unique Shortest Paths in Graphs
• A characterization of planar geodetic graphs
• On planar geodetic graphs
• On a problem of K. Zarankiewicz

This page was built for publication: Drawing Shortest Paths in Geodetic Graphs