Drawing Shortest Paths in Geodetic Graphs

DOI10.7155/jgaa.00598zbMath1498.05145OpenAlexW3063684895MaRDI QIDQ5050002

No author found.

Publication date: 14 November 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00598

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

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
• Geodetic graphs of diameter two

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