Axiomatic characterizations of Ptolemaic and chordal graphs
From MaRDI portal
Publication:6155779
Recommendations
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- The induced path function, monotonicity and betweenness
- Axiomatic characterization of the interval function of a graph
- Axiomatic characterization of the interval function of a bipartite graph
- Axiomatic characterization of the interval function of a bipartite graph
Cites work
- scientific article; zbMATH DE number 4085714 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 617118 (Why is no real title available?)
- scientific article; zbMATH DE number 1842910 (Why is no real title available?)
- scientific article; zbMATH DE number 1449370 (Why is no real title available?)
- scientific article; zbMATH DE number 5499517 (Why is no real title available?)
- A Characterization of Certain Ptolemaic Graphs
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A characterization of geodetic graphs
- A characterization of ptolemaic graphs
- A characterization of the interval function of a connected graph
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- A new proof of a characterization of the set of all geodesics in a connected graph
- A note on the interval function of a disconnected graph
- Axiomatic characterization of claw and paw-free graphs using graph transit functions
- Axiomatic characterization of the interval function of a bipartite graph
- Axiomatic characterization of the interval function of a block graph
- Axiomatic characterization of the interval function of a graph
- Finite Sholander trees, trees, and their betweenness
- Graph Classes: A Survey
- The induced path function, monotonicity and betweenness
- Trees, Lattices, Order, and Betweenness
Cited in
(11)- Axiomatic characterization of the interval function of a graph
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- The induced path function, monotonicity and betweenness
- The induced path transit function and the Pasch axiom
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Characterizing posets for which their natural transit functions coincide
- Axiomatic characterization of transit functions of hierarchies
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- Axiomatic characterization of the interval function of a bipartite graph
- Axiomatic characterization of claw and paw-free graphs using graph transit functions
- Laminar structure of ptolemaic graphs with applications
This page was built for publication: Axiomatic characterizations of Ptolemaic and chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155779)