Axiomatic characterizations of Ptolemaic and chordal graphs

DOI10.7494/opmath.2023.43.3.393zbMath1515.05058MaRDI QIDQ6155779

G. Narasimha-Shenoi Prasanth, Manoj Changat, Lekshmi Kamal K. Sheela

Publication date: 7 June 2023

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

interval functionPtolemaic graphsinduced path transit functiontransit functionbetweenness axioms

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite Sholander trees, trees, and their betweenness
• The induced path function, monotonicity and betweenness
• Axiomatic characterization of the interval function of a graph
• A note on the interval function of a disconnected graph
• A forbidden subgraph characterization of some graph classes using betweenness axioms
• Axiomatic characterization of the interval function of a block graph
• Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions
• Axiomatic Characterization of the Interval Function of a Bipartite Graph
• A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
• A characterization of ptolemaic graphs
• Graph Classes: A Survey
• A characterization of the interval function of a connected graph
• A new proof of a characterization of the set of all geodesics in a connected graph
• A characterization of geodetic graphs
• A Characterization of Certain Ptolemaic Graphs
• Trees, Lattices, Order, and Betweenness

This page was built for publication: Axiomatic characterizations of Ptolemaic and chordal graphs