A new proof of a characterization of the set of all geodesics in a connected graph

DOI10.1023/A:1022404126392zbMath0949.05021MaRDI QIDQ4515341

Ladislav Nebeský

Publication date: 13 November 2000

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30456

zbMATH Keywords

distancegeodesicpathconnected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (5)

The interval function of a connected graph and road systems ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ Unnamed Item ⋮ A theorem for an axiomatic approach to metric properties of graphs

Cites Work

• Geodesics and steps in a connected graph
• On the set of all shortest paths of a given length in a connected graph
• Unnamed Item
• Unnamed Item

This page was built for publication: A new proof of a characterization of the set of all geodesics in a connected graph