Distance-hereditary graphs
From MaRDI portal
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)- A note on \(r\)-dominating cliques
- On the partial order competition dimensions of chordal graphs
- On an extension of distance-hereditary graphs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Requiring chords in cycles
- The axiomatic characterization of the interval function of distance hereditary graphs
- MAD trees and distance-hereditary graphs
- On the null-homotopy of bridged graphs
- Steiner Wiener index of block graphs
- A characterization of line graphs that are squares of graphs
- Set graphs. IV. Further connections with claw-freeness
- Extended Distance-Hereditary Graphs
- Fat Hoffman graphs with smallest eigenvalue greater than -3
- Solutions of a problem of Ore on spanning trees and its generalization
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- Twin subgraphs and core-semiperiphery-periphery structures
- On the Galois lattice of bipartite distance hereditary graphs
- 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
- Distance-hereditary digraphs
- 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
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Functionality of box intersection graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- All-path convexity: two characterizations, general position number, and one algorithm
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
- Graphs with bounded induced distance
- Weighted maximum-clique transversal sets of graphs
- Extremal perfect graphs for a bound on the domination number
- Exploring the complexity boundary between coloring and list-coloring
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Injective hulls of various graph classes
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract)
- Mutual visibility in graphs
- Boundary properties of graphs for algorithmic graph problems
- Pseudo-modular graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- Subgraph trees in graph theory
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- A Helly theorem in weakly modular space
- Alternating cycle-free matchings
- Cover-incomparability graphs of posets
- On strict (outer-)confluent graphs
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A polyhedral investigation of star colorings
- The bi-join decomposition
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Isotropic systems
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Compatible decompositions and block realizations of finite metrics
- A polynomial kernel for 3-leaf power deletion
- A graph-theoretical invariant of topological spaces
- Twin-distance-hereditary digraphs
- Paired-domination problem on distance-hereditary graphs
- A note on connected dominating sets of distance-hereditary graphs
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- Characterizing k-chordal unichord-free graphs
- On hypergraph acyclicity and graph chordality
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Completely separable graphs
- Polyhedral studies of vertex coloring problems: the standard formulation
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- Dominating cliques in distance-hereditary graphs
- (k,+)-distance-hereditary graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- A note on distance matrices with unicyclic graph realizations
- The induced path transit function and the Pasch axiom
- Distance approximating spanning trees
- Clique cycle-transversals in distance-hereditary graphs
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- The Weisfeiler-Leman dimension of distance-hereditary graphs
- Reconstruction of distance hereditary 2-connected graphs
- Graph functionality
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- False-twin-free graphs with a fixed number of negative eigenvalues
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- On factorial properties of chordal bipartite graphs
- Probe Ptolemaic Graphs
- Requiring adjacent chords in cycles
- On the hyperbolicity of random graphs
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
- Extremal cubic graphs for fault-tolerant locating domination
- Leanness computation: small values and special graph classes
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Homogeneously orderable graphs
- On three domination-based identification problems in block graphs
- Lattices of regular closed subsets of closure spaces
- Progress towards the two-thirds conjecture on locating-total dominating sets
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)
