A characterization of uniquely representable graphs
From MaRDI portal
Cites work
- A canonical decomposition theory for metrics on a finite set
- A Characterization of Block-Graphs
- A Characterization of Certain Ptolemaic Graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A characterization of the interval function of a connected graph
- A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs
- A De Bruijn-Erdős theorem for 1-2 metric spaces.
- A de Bruijn-Erdős theorem for chordal graphs
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- A new class of graphs that satisfies the Chen-Chvátal conjecture
- A note on the metric properties of trees
- 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
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Bisplit graphs satisfy the Chen-Chvátal conjecture
- Characterizing block graphs in terms of their vertex-induced partitions
- Distance-hereditary graphs
- 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?)
- Induced Path Transit Function, Betweenness and Monotonicity
- Induced path transit function, monotone and Peano axioms
- Lines, betweenness and metric spaces
- On metric properties of certain clique graphs
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- Problems related to a de Bruijn-Erdös theorem
- Représentations en arbre de proximités relatives
- Six theorems about injective metric spaces
- Steiner intervals, geodesic intervals, and betweenness
- Sylvester-Gallai theorem and metric betweenness
- The All-Paths Transit Function of a Graph
- The category of X-nets
- The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs
- The induced path convexity, betweenness, and svelte graphs
- The induced path function, monotonicity and betweenness
- The induced path transit function and the Pasch axiom
- The interval function of a connected graph and a~characterization of geodetic graphs
- The square of a block graph
- The Sylvester-Chvátal theorem
- Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric
- Trees, Lattices, Order, and Betweenness
This page was built for publication: A characterization of uniquely representable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985968)