Drawing shortest paths in geodetic graphs

Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, Thomas Schneck

Research output: Contribution to journalArticlepeer-review

Abstract

Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph G, i.e., an unweighted graph in which the shortest path between any pair of vertices is unique, is there a philogeodetic drawing of G, i.e., a drawing of G in which the curves of any two shortest paths meet at most once? We answer this question in the negative by showing the existence of geodetic graphs that require some pair of shortest paths to cross at least four times. The bound on the number of crossings is tight for the class of graphs we construct. Furthermore, we exhibit geodetic graphs of diameter two that do not admit a philogeodetic drawing.

Original languageEnglish (US)
JournalUnknown Journal
StatePublished - Aug 17 2020

Keywords

  • Edge crossings
  • Geodetic graphs
  • Unique Shortest Paths

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'Drawing shortest paths in geodetic graphs'. Together they form a unique fingerprint.

Cite this