Axiomatic characterization of the interval function of a graph

DOI10.1016/j.ejc.2008.09.007zbMath1205.05074OpenAlexW2148760280WikidataQ125879922 ScholiaQ125879922MaRDI QIDQ1024316

Ladislav Nebeský, Henry Martyn Mulder

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/13768

zbMATH Keywords

interval functionmetric graph theory

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (27)

Cut vertex transit functions of hypergraphs ⋮ Unnamed Item ⋮ Axiomatic characterization of transit functions of hierarchies ⋮ On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products ⋮ Axiomatic characterization of the interval function of a block graph ⋮ Guides and shortcuts in graphs ⋮ Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ A note on the interval function of a disconnected graph ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Axiomatic characterization of the toll walk function of some graph classes ⋮ Segment transit function of the induced path function of graphs and its first-order definability ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ On subbetweennesses of trees: hardness, algorithms, and characterizations ⋮ First-order logic axiomatization of metric graph theory ⋮ 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 ⋮ Finite Sholander trees, trees, and their betweenness ⋮ Unnamed Item ⋮ Computing the blocks of a quasi-median graph ⋮ Transit sets of -point crossover operators ⋮ On finite convexity spaces induced by sets of paths in graphs ⋮ The induced path function, monotonicity and betweenness ⋮ Axiomatic characterization of transit functions of weak hierarchies ⋮ Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-modular graphs
• The structure of median graphs
• Median graphs and Helly hypergraphs
• The induced path convexity, betweenness, and svelte graphs
• Intervals and steps in a connected graph
• The interval function of a connected graph and road systems
• The All-Paths Transit Function of a Graph
• Metric Ternary Distributive Semi-Lattices
• Ternary spaces, media, and Chebyshev sets
• A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
• A characterization of the interval function of a connected graph
• A Characterization of Certain Ptolemaic Graphs
• Trees, Lattices, Order, and Betweenness

This page was built for publication: Axiomatic characterization of the interval function of a graph