Graph classes between parity and distance-hereditary graphs
From MaRDI portal
Publication:1302157
Recommendations
Cited in
(11)- Practical and efficient split decomposition via graph-labelled trees
- Graphs with bounded induced distance
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- (\(k,+\))-distance-hereditary graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Networks with small stretch number
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- Distance-hereditary comparability graphs
- Equistable distance-hereditary graphs
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary 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)