Graph classes between parity and distance-hereditary graphs
From MaRDI portal
Recommendations
Cited in
(11)- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Graphs with bounded induced distance
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- (k,+)-distance-hereditary graphs
- Networks with small stretch number
- Practical and efficient split decomposition via graph-labelled trees
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- Equistable distance-hereditary graphs
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- Distance-hereditary comparability graphs
This page was built for publication: Graph classes between parity and distance-hereditary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302157)