Pages that link to "Item:Q5195033"
From MaRDI portal
The following pages link to An Exact Enumeration of Distance-Hereditary Graphs (Q5195033):
Displaying 10 items.
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- On an extension of distance-hereditary graphs (Q3439343) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs (Q6610090) (← links)