Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations

DOI10.1137/1.9781611975062.11zbMath1433.05158OpenAlexW2782507624MaRDI QIDQ5195112

Jérémie Lumbroso, Jessica Shi

Publication date: 18 September 2019

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

Full work available at URL: https://doi.org/10.1137/1.9781611975062.11

zbMATH Keywords

distance-hereditary graphsvertex incremental characterizations of graph classes

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (1)

Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs

This page was built for publication: Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations