Pages that link to "Item:Q1302157"
From MaRDI portal
The following pages link to Graph classes between parity and distance-hereditary graphs (Q1302157):
Displaying 4 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Networks with small stretch number (Q876723) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)