A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
An Exact Enumeration of Distance-Hereditary Graphs
2017
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomposition. The previous best enumerative result for these graphs is from Nakano et al. (J. Comp. Sci. Tech., 2007), who have proven that the number of distancehereditary graphs on n vertices is bounded by 2 3.59n . In this paper, using classical tools of enumerative combinatorics, we improve on this result by providing
doi:10.1137/1.9781611974775.3
dblp:conf/analco/ChauveFL17
fatcat:cum2zdrtrnfwdo7qdbs3lh5rgq