A Characterization of Certain Ptolemaic Graphs

Cited in

(32)

Axiomatic characterization of the interval function of a graph
Distance-hereditary graphs
On hypergraph acyclicity and graph chordality
On the parameters of codes for the Lee and modular distance
On metric properties of certain clique graphs
Distance labeling scheme and split decomposition
Powers of distance-hereditary graphs
Node-searching problem on block graphs
Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
Lattices of regular closed subsets of closure spaces
Enumerating Minimal Tropical Connected Sets
Probe Ptolemaic Graphs
On the distance function of a connected graph
A characterization of ptolemaic graphs
Geodesics and steps in a connected graph
A characterization of the interval function of a connected graph
A cut locus for finite graphs and the farthest point mapping
Treewidth versus clique number. I: Graph classes with a forbidden structure
Isometric rigidity of Wasserstein spaces: the graph metric case
scientific article; zbMATH DE number 7090175 (Why is no real title available?)
Block-graph width
Axiomatic characterizations of Ptolemaic and chordal graphs
First-order logic axiomatization of metric graph theory
LexBFS-orderings and powers of graphs
Graphs with odd and even distances between non-cut vertices
Enumerations, forbidden subgraph characterizations, and the split-decomposition
The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
Graphs with parity conditions on distances between cut and noncut vertices
Representing distance-hereditary graphs with multi-rooted trees
Convex geometries yielded by transit functions
A characterization of uniquely representable graphs
Characterization of the geodesic distance on infinite graphs

This page was built for publication: A Characterization of Certain Ptolemaic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514305)