A characterization of ptolemaic graphs
From MaRDI portal
Cited in
(57)- Laminar structure of ptolemaic graphs with applications
- Distance-hereditary graphs
- The center and the distance center of a Ptolemaic graph
- On hypergraph acyclicity and graph chordality
- Representations of graphs and networks (coding, layouts and embeddings)
- On metric properties of certain clique graphs
- Reconstruction of distance hereditary 2-connected graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- On the Steiner, geodetic and hull numbers of graphs
- Tree spanners on chordal graphs: complexity and algorithms
- The structure of the centroid in a Ptolemaic graph
- Powers of distance-hereditary graphs
- Ptolemaic and chordal cover-incomparability graphs
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Some new classes of open distance-pattern uniform graphs
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- Good characterizations and linear time recognition for 2-probe block graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Rebuilding convex sets in graphs
- Algorithms for deletion problems on split graphs
- Ptolemaic and planar cover-incomparability graphs
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- The recognition of geodetically connected graphs
- Recognition of Probe Ptolemaic Graphs
- When every k-cycle has at least f(k) chords
- A note on path domination
- Probe Ptolemaic Graphs
- Convexity in Graphs and Hypergraphs
- A note on sparseness conditions on chordless vertices of cycles
- Restricted unimodular chordal graphs
- Forests and trees among Gallai graphs
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- New results on Ptolemaic graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Graph theory (algorithmic, algebraic, and metric problems)
- Intersection of longest paths in graph classes
- Axiomatic characterizations of Ptolemaic and chordal graphs
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- First-order logic axiomatization of metric graph theory
- LexBFS-orderings and powers of graphs
- On monophonic position sets in graphs
- Shared ancestry graphs and symbolic arboreal maps
- Characterizations of graph classes via convex geometries: a survey
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Peakless functions on graphs
- The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
- Smaller kernels for 3-leaf power modifications problems
- Representing distance-hereditary graphs with multi-rooted trees
- Convex geometries yielded by transit functions
- Clique graphs and Helly graphs
- On the geodetic iteration number of distance-hereditary graphs
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Extremal perfect graphs for a bound on the domination number
- Rooted directed path graphs are leaf powers
This page was built for publication: A characterization of ptolemaic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877730)
