A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
From MaRDI portal
Publication:4154586
DOI10.1093/qmath/28.4.417zbMath0376.05040OpenAlexW1981356557MaRDI QIDQ4154586
Publication date: 1977
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/28.4.417
Related Items
The Weisfeiler-Leman dimension of distance-hereditary graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Lexbfs-orderings and powers of hhd-free graphs∗ ⋮ Distance-hereditary graphs ⋮ Pseudo-modular graphs ⋮ A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ Efficient parallel recognition algorithms of cographs and distance hereditary graphs ⋮ Dominating cliques in distance-hereditary graphs ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ Weighted efficient domination problem on some perfect graphs ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Powers of distance-hereditary graphs ⋮ Injective hulls of various graph classes ⋮ A note on path domination ⋮ Symmetric graph-theoretic roles of two-pairs and chords of cycles ⋮ Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs ⋮ Hereditary modular graphs ⋮ On edge perfectness and classes of bipartite graphs ⋮ On hypergraph acyclicity and graph chordality ⋮ On graphs with 2 trivial distance ideals ⋮ Networks with small stretch number ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ A note on \(r\)-dominating cliques ⋮ Online perceptual learning and natural language acquisition for autonomous robots ⋮ A note on sparseness conditions on chordless vertices of cycles ⋮ On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ On the Carathéodory number of interval and graph convexities ⋮ Homogeneously orderable graphs ⋮ Homogeneously orderable graphs and the Steiner tree problem ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Twin-distance-hereditary digraphs ⋮ Steiner distance and convexity in graphs ⋮ A note on connected dominating sets of distance-hereditary graphs ⋮ Subgraph trees in graph theory ⋮ Finding a central vertex in an HHD-free graph ⋮ MAD trees and distance-hereditary graphs ⋮ Requiring adjacent chords in cycles ⋮ Unnamed Item ⋮ Completely separable graphs ⋮ Simple linear-time algorithms for counting independent sets in distance-hereditary graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ Obstructions for linear rank-width at most 1 ⋮ Dualizing distance-hereditary graphs ⋮ The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs ⋮ LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ Which distance-hereditary graphs are cover-incomparability graphs? ⋮ Clique-width with an inactive label ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs ⋮ A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs ⋮ Metric characterization of parity graphs ⋮ Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Bipartite almost distance-hereditary graphs ⋮ On retracts, absolute retracts, and foldings in cographs ⋮ Equistable distance-hereditary graphs ⋮ On complexities of minus domination ⋮ Recognizing locally equivalent graphs ⋮ Some new classes of open distance-pattern uniform graphs ⋮ Distance-hereditary graphs and signpost systems ⋮ Graphs with bounded induced distance ⋮ Distance-hereditary comparability graphs ⋮ Helly theorems for 3-Steiner and 3-monophonic convexity in graphs ⋮ Rooted directed path graphs are leaf powers ⋮ Paired-domination problem on distance-hereditary graphs ⋮ Restricted unimodular chordal graphs ⋮ The Hamiltonian problem on distance-hereditary graphs ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs ⋮ On the Steiner, geodetic and hull numbers of graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A polynomial kernel for distance-hereditary vertex deletion ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ Steiner centers and Steiner medians of graphs ⋮ Cover-incomparability graphs of posets ⋮ Weighted connected domination and Steiner trees in distance-hereditary graphs ⋮ On an extension of distance hereditary graphs ⋮ Minimum Eccentricity Shortest Paths in Some Structured Graph Classes ⋮ A note on the triameter of graphs ⋮ Laminar structure of ptolemaic graphs with applications ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Distance-Hereditary Comparability Graphs ⋮ Characterizations of Graphs with Stretch Number less than 2 ⋮ A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers ⋮ Self-spanner graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs ⋮ Rebuilding convex sets in graphs ⋮ Requiring chords in cycles ⋮ Eccentricity function in distance-hereditary graphs ⋮ Computing maximum stable sets for distance-hereditary graphs ⋮ Distance ideals of graphs ⋮ ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES ⋮ Simplicial Powers of Graphs ⋮ On an edge partition and root graphs of some classes of line graphs ⋮ Block duplicate graphs and a hierarchy of chordal graphs ⋮ Fast and simple algorithms for counting dominating sets in distance-hereditary graphs ⋮ On Complexities of Minus Domination ⋮ Extended Distance-Hereditary Graphs ⋮ On an extension of distance-hereditary graphs ⋮ On the Galois lattice of bipartite distance hereditary graphs
This page was built for publication: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
