Intervals and steps in a connected graph

DOI10.1016/j.disc.2003.11.056zbMath1053.05041OpenAlexW2096362743MaRDI QIDQ1883264

Ladislav Nebeský

Publication date: 1 October 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.056

zbMATH Keywords

distancegeodesicinterval functionstep

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (5)

Guides and shortcuts in graphs ⋮ On subbetweennesses of trees: hardness, algorithms, and characterizations ⋮ Finite Sholander trees, trees, and their betweenness ⋮ Axiomatic characterization of the interval function of a graph ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Helly theorem in weakly modular space
• On Properties of a Graph that Depend on its Distance Function
• Geodesics and steps in a connected graph
• Modular Interval Spaces
• A characterization of the interval function of a connected graph
• An axiomatic approach to metric properties of connected graphs
• A theorem for an axiomatic approach to metric properties of graphs
• Modular and median signpost systems and their underlying graphs

This page was built for publication: Intervals and steps in a connected graph