A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
From MaRDI portal
Publication:4154586
DOI10.1093/QMATH/28.4.417zbMATH Open0376.05040OpenAlexW1981356557MaRDI QIDQ4154586FDOQ4154586
Authors: Edward Howorka
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
Cited In (only showing first 100 items - show all)
- A note on \(r\)-dominating cliques
- MAD trees and distance-hereditary graphs
- On an edge partition and root graphs of some classes of line graphs
- On retracts, absolute retracts, and foldings in cographs
- Distance Hereditary Graphs and the Interlace Polynomial
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- Distance-hereditary graphs and signpost systems
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Graphs with bounded induced distance
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- On an extension of distance hereditary graphs
- Pseudo-modular graphs
- Subgraph trees in graph theory
- Finding a central vertex in an HHD-free graph
- Cover-incomparability graphs of posets
- 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
- Distance-hereditary comparability graphs
- On the Carathéodory number of interval and graph convexities
- A note on connected dominating sets of distance-hereditary graphs
- On hypergraph acyclicity and graph chordality
- Dominating cliques in distance-hereditary graphs
- Completely separable 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
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- Distance-hereditary graphs
- Homogeneously orderable graphs
- Networks with small stretch number
- Hamilton cycles in almost distance-hereditary graphs
- Lexbfs-orderings and powers of hhd-free graphs∗
- On edge perfectness and classes of bipartite graphs
- Clique-width with an inactive label
- Practical and efficient split decomposition via graph-labelled trees
- Recognizing locally equivalent graphs
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Equistable distance-hereditary graphs
- A note on path domination
- Rebuilding convex sets in graphs
- Steiner distance and convexity in graphs
- Weighted efficient domination problem on some perfect graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs
- Simplicial Powers of Graphs
- Metric characterization of parity graphs
- Hereditary modular graphs
- Eccentricity function in distance-hereditary graphs
- Powers of distance-hereditary graphs
- Rooted directed path graphs are leaf powers
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- On the Steiner, geodetic and hull numbers of graphs
- Block duplicate graphs and a hierarchy of chordal graphs
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Laminar structure of ptolemaic graphs with applications
- Obstructions for linear rank-width at most 1
- The Hamiltonian problem on distance-hereditary graphs
- Distance-hereditary comparability graphs
- Symmetric graph-theoretic roles of two-pairs and chords of cycles
- A note on sparseness conditions on chordless vertices of cycles
- Computing maximum stable sets for distance-hereditary graphs
- On an extension of distance-hereditary graphs
- Requiring chords in cycles
- Title not available (Why is that?)
- Extended Distance-Hereditary Graphs
- On the Galois lattice of bipartite distance hereditary graphs
- Dualizing distance-hereditary graphs
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
- Injective hulls of various graph classes
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- Steiner centers and Steiner medians of graphs
- Twin-distance-hereditary digraphs
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- Paired-domination problem on distance-hereditary graphs
- On complexities of minus domination
- The Weisfeiler-Leman dimension of distance-hereditary graphs
- Reconstruction of distance hereditary 2-connected graphs
- Some new classes of open distance-pattern uniform graphs
- Requiring adjacent chords in cycles
- Word-representability of graphs with respect to split recomposition
- Which distance-hereditary graphs are cover-incomparability graphs?
- Restricted unimodular chordal graphs
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- Distance ideals of graphs
- First-order logic axiomatization of metric graph theory
- Online perceptual learning and natural language acquisition for autonomous robots
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- On graphs with 2 trivial distance ideals
- A polynomial kernel for distance-hereditary vertex deletion
- A note on the triameter of graphs
- Characterizations of graphs with stretch number less than 2
- $$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
- Bipartite almost distance-hereditary graphs
- Self-spanner graphs
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes
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)