Pages that link to "Item:Q5425425"
From MaRDI portal
The following pages link to A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs (Q5425425):
Displaying 11 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- The Weisfeiler-Leman dimension of distance-hereditary graphs (Q6166669) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
