Recommendations
Cites work
- scientific article; zbMATH DE number 3880762 (Why is no real title available?)
- scientific article; zbMATH DE number 3681808 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3757213 (Why is no real title available?)
- scientific article; zbMATH DE number 3773620 (Why is no real title available?)
- scientific article; zbMATH DE number 3779384 (Why is no real title available?)
- scientific article; zbMATH DE number 3892077 (Why is no real title available?)
- scientific article; zbMATH DE number 3331438 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Characterization of Certain Ptolemaic Graphs
- A characterization of ptolemaic graphs
- A note on the metric properties of trees
- A note on the tree realizability of a distance matrix
- Complement reducible graphs
- Dacey Graphs
- Medians in median graphs
- On a class of posets and the corresponding comparability graphs
- On metric properties of certain clique graphs
- Parity Graphs
Cited in
(only showing first 100 items - show all)- Probe Ptolemaic Graphs
- On some graph classes related to perfect graphs: a survey
- On strict (outer-)confluent graphs
- Rank-width: algorithmic and structural results
- Graphs with bounded induced distance
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- (\(k,+\))-distance-hereditary graphs
- Pseudo-modular graphs
- On strong tree-breadth
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Conflict-free coloring: graphs of bounded clique width and intersection graphs
- Clique-width of graphs defined by one-vertex extensions
- Linear-time algorithm for the matched-domination problem in cographs
- On an extension of distance hereditary graphs
- Eccentricity function in distance-hereditary graphs
- Laminar structure of ptolemaic graphs with applications
- Networks with small stretch number
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- A note on distance matrices with unicyclic graph realizations
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Extremal perfect graphs for a bound on the domination number
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- Alternating cycle-free matchings
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- On the geodetic iteration number of distance-hereditary graphs
- The maximum infection time in the geodesic and monophonic convexities
- On the non-commuting graph of dihedral group
- Isotropic matroids. I: Multimatroids and neighborhoods
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- The induced path transit function and the Pasch axiom
- Homogeneously orderable graphs
- Hereditary modular graphs
- MAD trees and distance-hereditary graphs
- Characterizing k-chordal unichord-free graphs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Lattices of regular closed subsets of closure spaces
- New results on Ptolemaic graphs
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Representations of graphs and networks (coding, layouts and embeddings)
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- A polynomial kernel for 3-leaf power deletion
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- Distance-hereditary graphs and signpost systems
- Domination in distance-hereditary graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- Distance-hereditary digraphs
- On the null-homotopy of bridged graphs
- A graph-theoretical invariant of topological spaces
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Clique-width with an inactive label
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- On an extension of distance-hereditary graphs
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Obstructions for linear rank-width at most 1
- Forests and trees among Gallai graphs
- Partial characterizations of circle graphs
- Quasi-threshold graphs
- Boundary properties of graphs for algorithmic graph problems
- The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs
- Characterization and recognition of some opposition and coalition graph classes
- Isotropic systems
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
- On hypergraph acyclicity and graph chordality
- A Helly theorem in weakly modular space
- Powers of distance-hereditary graphs
- The Hamiltonian problem on distance-hereditary graphs
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- A note on connected dominating sets of distance-hereditary graphs
- Almost distance-hereditary graphs
- Rebuilding convex sets in graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A polyhedral investigation of star colorings
- On the spectrum and number of convex sets in graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Weighted maximum-clique transversal sets of graphs
- Recognizing locally equivalent graphs
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- On the hyperbolicity of random graphs
- A characterization of line graphs that are squares of graphs
- Set graphs. IV. Further connections with claw-freeness
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
- On factorial properties of chordal bipartite graphs
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Steiner Wiener index of block graphs
- Rank-width and vertex-minors
- Distance-hereditary comparability graphs
- Dominating cliques in distance-hereditary graphs
- Clique graphs and Helly graphs
- Rooted directed path graphs are leaf powers
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Cover-incomparability graphs of posets
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Distance-hereditary graphs are clique-perfect
This page was built for publication: Distance-hereditary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084114)
