Distance-hereditary digraphs
From MaRDI portal
Publication:972365
Recommendations
Cites work
- (k,+)-distance-hereditary graphs
- Almost distance-hereditary graphs
- Centers and medians of distance-hereditary graphs
- Completely separable graphs
- Distance-hereditary graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Graphs with small additive stretch number
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1262797 (Why is no real title available?)
- scientific article; zbMATH DE number 815104 (Why is no real title available?)
- Networks with small stretch number
Cited in
(8)- (k,+)-distance-hereditary graphs
- Distance-hereditary graphs are clique-perfect
- Double-crossed chords and distance-hereditary graphs
- On an extension of distance-hereditary graphs
- Almost distance-hereditary graphs
- Twin-distance-hereditary digraphs
- Directed transit functions
- Distance-hereditary graphs and signpost systems
This page was built for publication: Distance-hereditary digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972365)