A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph

DOI10.1023/A:1013744324808zbMath1079.05505OpenAlexW156667255MaRDI QIDQ3366581

Ladislav Nebeský

Publication date: 14 February 2006

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

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

zbMATH Keywords

interval functiondistance in a graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (17)

Cut vertex transit functions of hypergraphs ⋮ The interval function of a connected graph and road systems ⋮ Axiomatic characterization of the interval function of a block graph ⋮ Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations ⋮ A note on the interval function of a disconnected graph ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ Axiomatic characterization of the interval function of a bipartite graph ⋮ On transit functions in weighted graphs ⋮ Axiomatic Characterization of the Interval Function of a Bipartite Graph ⋮ Unnamed Item ⋮ The induced path function, monotonicity and betweenness ⋮ Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs ⋮ Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions ⋮ On the distance function of a connected graph ⋮ Axiomatic characterization of the interval function of a graph ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness

Cites Work

• A Helly theorem in weakly modular space
• Modular Interval Spaces
• A characterization of the interval function of a connected graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph