A characterization of the interval function of a connected graph

From MaRDI portal
Publication:4303494

DOI10.21136/cmj.1994.128449zbMath0808.05046OpenAlexW2724587737MaRDI QIDQ4303494

Ladislav Nebeský

Publication date: 25 August 1994

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




Related Items (37)

Cut vertex transit functions of hypergraphsIntervals and steps in a connected graphThe interval function of a connected graph and road systemsInduced path transit function, monotone and Peano axiomsExtreme Geodesic GraphsThe Directed Geodetic Structure of a Strong DigraphA general framework for path convexitiesA note on path dominationAxiomatic characterization of the interval function of a block graphInterval function, induced path function, (claw, paw)-free graphs and axiomatic characterizationsA note on the interval function of a disconnected graphThe axiomatic characterization of the interval function of distance hereditary graphsSegment transit function of the induced path function of graphs and its first-order definabilityAxiomatic characterizations of Ptolemaic and chordal graphsFirst-order logic axiomatization of metric graph theoryAxiomatic characterization of the interval function of a bipartite graphOn transit functions in weighted graphsAxiomatic Characterization of the Interval Function of a Bipartite GraphUnnamed ItemTransit sets of -point crossover operatorsThe All-Paths Transit Function of a GraphThe induced path function, monotonicity and betweennessConvexities related to path properties on graphsConvexity in oriented graphsThe induced path transit function and the Pasch axiomAxiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit FunctionsA Characterization of the Interval Function of a (Finite or Infinite) Connected GraphUnnamed ItemOn the distance function of a connected graphUnnamed ItemAn axiomatic approach to metric properties of connected graphsA theorem for an axiomatic approach to metric properties of graphsAxiomatic characterization of the interval function of a graphGeodesics and steps in a connected graphBetweenness in graphs: a short survey on shortest and induced path betweennessGeodetic number of powers of cyclesThe Forcing Convexity Number of a Graph



Cites Work


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