Axiomatic characterizations of Ptolemaic and chordal graphs
From MaRDI portal
Publication:6155779
DOI10.7494/OPMATH.2023.43.3.393zbMATH Open1515.05058MaRDI QIDQ6155779FDOQ6155779
Authors: Manoj Changat, Lekshmi Kamal K. Sheela, G. N. Prasanth
Publication date: 7 June 2023
Published in: Opuscula Mathematica (Search for Journal in Brave)
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
Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Graph Classes: A Survey
- Title not available (Why is that?)
- A characterization of ptolemaic graphs
- A characterization of the interval function of a connected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatic characterization of the interval function of a graph
- Title not available (Why is that?)
- Trees, Lattices, Order, and Betweenness
- The induced path function, monotonicity and betweenness
- A Characterization of Certain Ptolemaic Graphs
- Title not available (Why is that?)
- Finite Sholander trees, trees, and their betweenness
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- A characterization of geodetic graphs
- Axiomatic characterization of the interval function of a block graph
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A note on the interval function of a disconnected graph
- Axiomatic characterization of the interval function of a bipartite graph
- Axiomatic characterization of claw and paw-free graphs using graph transit functions
- Title not available (Why is that?)
- A new proof of a characterization of the set of all geodesics in a connected graph
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)