Intervals and steps in a connected graph
From MaRDI portal
Publication:1883264
DOI10.1016/J.DISC.2003.11.056zbMATH Open1053.05041OpenAlexW2096362743MaRDI QIDQ1883264FDOQ1883264
Authors: 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
Recommendations
- On Properties of a Graph that Depend on its Distance Function
- An axiomatic approach to metric properties of connected graphs
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- The interval function of a connected graph and a~characterization of geodetic graphs
- Geodesics and steps in a connected graph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tree as a finite nonempty set with a binary operation
- A characterization of the interval function of a connected graph
- Title not available (Why is that?)
- On Properties of a Graph that Depend on its Distance Function
- Geodesics and steps in a connected graph
- An axiomatic approach to metric properties of connected graphs
- Modular and median signpost systems and their underlying graphs
- A Helly theorem in weakly modular space
- The interval function of a connected graph and a~characterization of geodetic graphs
- Modular Interval Spaces
- A theorem for an axiomatic approach to metric properties of graphs
Cited In (10)
- Axiomatic characterization of the interval function of a graph
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- On certain extensions of intervals in graphs
- On Properties of a Graph that Depend on its Distance Function
- A theorem for an axiomatic approach to metric properties of graphs
- Title not available (Why is that?)
- Finite Sholander trees, trees, and their betweenness
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- Guides and shortcuts in graphs
- The interval function of a connected graph and a~characterization of geodetic graphs
This page was built for publication: Intervals and steps in a connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883264)