A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS

Cited in

(only showing first 100 items - show all)

Minimum eccentricity shortest paths in some structured graph classes
Representing distance-hereditary graphs with multi-rooted trees
A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Laminar structure of ptolemaic graphs with applications
Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
Obstructions for linear rank-width at most 1
A note on sparseness conditions on chordless vertices of cycles
The Hamiltonian problem on distance-hereditary graphs
Distance-hereditary comparability graphs
Homogeneously orderable graphs and the Steiner tree problem
Symmetric graph-theoretic roles of two-pairs and chords of cycles
Computing maximum stable sets for distance-hereditary graphs
LexBFS-orderings and powers of graphs
A note on \(r\)-dominating cliques
On monophonic position sets in graphs
On an extension of distance-hereditary graphs
Requiring chords in cycles
The axiomatic characterization of the interval function of distance hereditary graphs
MAD trees and distance-hereditary graphs
Extended Distance-Hereditary Graphs
On the Galois lattice of bipartite distance hereditary graphs
On retracts, absolute retracts, and foldings in cographs
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
On an edge partition and root graphs of some classes of line graphs
Distance-hereditary graphs and signpost systems
Dualizing distance-hereditary graphs
On an extension of distance hereditary graphs
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Distance Hereditary Graphs and the Interlace Polynomial
Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
Graphs with bounded induced distance
Injective hulls of various graph classes
Pseudo-modular graphs
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Subgraph trees in graph theory
Finding a central vertex in an HHD-free graph
Cover-incomparability graphs of posets
Steiner centers and Steiner medians of graphs
On walk domination: weakly toll domination, l₂ and l₃ domination
A characterization of uniquely representable graphs
Weighted connected domination and Steiner trees in distance-hereditary graphs
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
On the Carathéodory number of interval and graph convexities
Twin-distance-hereditary digraphs
Paired-domination problem on distance-hereditary graphs
A note on connected dominating sets of distance-hereditary graphs
On distance preserving and sequentially distance preserving graphs
_i-metric graphs: radius, diameter and all eccentricities
Conflict-free coloring: graphs of bounded clique-width and intersection graphs
Distance-hereditary comparability graphs
Primitive, edge-short, isometric, and pantochordal cycles
On hypergraph acyclicity and graph chordality
Completely separable graphs
On complexities of minus domination
Dominating cliques in distance-hereditary graphs
(k,+)-distance-hereditary graphs
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
The Weisfeiler-Leman dimension of distance-hereditary graphs
Graph theory (algorithmic, algebraic, and metric problems)
Reconstruction of distance hereditary 2-connected graphs
L(2,1)-labeling of perfect elimination bipartite graphs
Some new classes of open distance-pattern uniform graphs
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Directed transit functions
Requiring adjacent chords in cycles
Distance-hereditary graphs
Homogeneously orderable graphs
Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
Networks with small stretch number
On the clique-width of some perfect graph classes
Hamilton cycles in almost distance-hereditary graphs
Word-representability of graphs with respect to split recomposition
Lexbfs-orderings and powers of hhd-free graphs^∗
Clique-width with an inactive label
Practical and efficient split decomposition via graph-labelled trees
Which distance-hereditary graphs are cover-incomparability graphs?
On edge perfectness and classes of bipartite graphs
Restricted unimodular chordal graphs
Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
Recognizing locally equivalent graphs
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Distance ideals of graphs
A note on path domination
Equistable distance-hereditary graphs
Rebuilding convex sets in graphs
First-order logic axiomatization of metric graph theory
Online perceptual learning and natural language acquisition for autonomous robots
Steiner distance and convexity in graphs
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
On complexities of minus domination
Weighted efficient domination problem on some perfect graphs
On graphs with 2 trivial distance ideals
The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs
A tight relation between series-parallel graphs and bipartite distance hereditary graphs
Metric characterization of parity graphs

This page was built for publication: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS

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