Pages that link to "Item:Q4154586"
From MaRDI portal
The following pages link to A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS (Q4154586):
Displaying 50 items.
- A note on the triameter of graphs (Q2065800) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- On graphs with 2 trivial distance ideals (Q2174093) (← links)
- Dualizing distance-hereditary graphs (Q2214323) (← links)
- Some new classes of open distance-pattern uniform graphs (Q2248722) (← links)
- Distance ideals of graphs (Q2332421) (← links)
- On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Which distance-hereditary graphs are cover-incomparability graphs? (Q2446853) (← links)
- Bipartite almost distance-hereditary graphs (Q2470455) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
- Steiner centers and Steiner medians of graphs (Q2519846) (← links)
- Self-spanner graphs (Q2565853) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
- Requiring chords in cycles (Q2566156) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- Online perceptual learning and natural language acquisition for autonomous robots (Q2667822) (← links)
- Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs (Q2719843) (← links)
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes (Q2827811) (← links)
- Distance-Hereditary Comparability Graphs (Q2840542) (← links)
- Characterizations of Graphs with Stretch Number less than 2 (Q2840738) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Symmetric graph-theoretic roles of two-pairs and chords of cycles (Q2920879) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
- Extended Distance-Hereditary Graphs (Q3439120) (← links)
- On an extension of distance-hereditary graphs (Q3439343) (← links)
- Restricted unimodular chordal graphs (Q4229266) (← links)
- Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup> (Q4254590) (← links)
- Requiring adjacent chords in cycles (Q4603869) (← links)
- On an edge partition and root graphs of some classes of line graphs (Q5006610) (← links)
- (Q5009491) (← links)
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
- Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- The axiomatic characterization of the interval function of distance hereditary graphs (Q6126719) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
- The Weisfeiler-Leman dimension of distance-hereditary graphs (Q6166669) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)
