On the set of all shortest paths of a given length in a connected graph

DOI10.21136/CMJ.1996.127279zbMath0902.05042OpenAlexW2614203520MaRDI QIDQ4396135

Ladislav Nebeský

Publication date: 2 December 1998

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

zbMATH Keywords

shortest pathcharacterizationconnected graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

An axiomatic approach to metric properties of connected graphs ⋮ Geodesics and steps in a connected graph ⋮ A new proof of a characterization of the set of all geodesics in a connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the set of all shortest paths of a given length in a connected graph