An Exact Enumeration of Distance-Hereditary Graphs

DOI10.1137/1.9781611974775.3zbMath1429.05102arXiv1608.01464OpenAlexW2963355426MaRDI QIDQ5195033

Jérémie Lumbroso, Cedric Chauve, Éric Fusy

Publication date: 17 September 2019

Published in: 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01464

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Grammars and clique-width bounds from split decompositions ⋮ Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition

This page was built for publication: An Exact Enumeration of Distance-Hereditary Graphs