Pages that link to "Item:Q1302157"

The following pages link to Graph classes between parity and distance-hereditary graphs (Q1302157):

Displaying 9 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)
• Distance-hereditary comparability graphs (Q1759843) (← links)
• (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
• Equistable distance-hereditary graphs (Q2473043) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
• Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)