The interval function of a connected graph and road systems

DOI10.1016/j.disc.2005.12.051zbMath1119.05033OpenAlexW2149177469MaRDI QIDQ2370446

Ladislav Nebeský

Publication date: 26 June 2007

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

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

zbMATH Keywords

connected graphinterval functionroad systemintervaloid function

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (5)

On subbetweennesses of trees: hardness, algorithms, and characterizations ⋮ On transit functions in weighted graphs ⋮ 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
• Ternary spaces, media, and Chebyshev sets
• A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
• Modular Interval Spaces
• A characterization of the interval function of a connected graph
• A new proof of a characterization of the set of all geodesics in a connected graph
• The set of geodesics in a graph

This page was built for publication: The interval function of a connected graph and road systems