On the number of labeled graphs of bounded treewidth

Beineke, 1969, The number of labeled k-dimensional trees, J. Combin. Theory, 6, 200, 10.1016/S0021-9800(69)80120-1 Bodirsky, 2007, Enumeration and limit laws for series-parallel graphs, European J. Combin., 28, 2091, 10.1016/j.ejc.2007.04.011 Bodlaender, 1992 H.L. Bodlaender, J. Nederlof, Subexponential time algorithms for finding small tree and path decompositions, 2016, CoRR abs/1601.02415. H.L. Bodlaender, J. Nederlof, T.C. van der Zanden, Subexponential time algorithms for embedding H-minor free graphs, in: Proc. of the 43rd International Colloquium on Automata, Languages, and Programming, ICALP, in: LIPIcs, vol. 55, 2016, pp. 9:1–9:14. Cygan, 2015 Drmota, 2016, An asymptotic analysis of labeled and unlabeled k-trees, Algorithmica, 75, 579, 10.1007/s00453-015-0039-1 Flajolet, 2009 Foata, 1971, Enumerating k-trees, Discrete Math., 1, 181, 10.1016/0012-365X(71)90023-9 F.V. Fomin, D. Lokshtanov, N. Misra, S. Saurabh, Planar F-deletion: Approximation, kernelization and optimal FPT algorithms, in: Proc. of the 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2012, pp. 470–479. Gainer-Dewar, 2012, Γ-species and the enumeration of k-trees, Electron. J. Combin., 19, P45, 10.37236/2615 Gainer-Dewar, 2014, Counting unlabeled k-trees, J. Combin Theory Ser. B, 126, 177, 10.1016/j.jcta.2014.05.002 Gajarský, 2017, Kernelization using structural parameters on sparse graph classes, J. Comput. System Sci., 84, 219, 10.1016/j.jcss.2016.09.002 Gao, 2012, Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs, Discrete Appl. Math., 160, 566, 10.1016/j.dam.2011.10.013 B.M.P. Jansen, D. Lokshtanov, S. Saurabh, A near-optimal planarization algorithm, in: Proc. of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2014, pp. 1802–1811. Kim, 2016, Linear kernels and single-exponential algorithms via protrusion decompositions, ACM Trans. Algorithms, 12, 21, 10.1145/2797140 Kloks, 1994, vo. l842 D. Mitsche, G. Perarnau, On the treewidth and related parameters of random geometric graphs, in: Proc. of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS, LIPIcs, vol. 14, 2012, pp. 408–419. Moon, 1969, The number of labeled k-trees, J. Combin. Theory, 6, 196, 10.1016/S0021-9800(69)80119-5 Osthus, 2003, On random planar graphs, the number of planar graphs and their triangulations, J. Combin. Theory Ser. B, 88, 119, 10.1016/S0095-8956(02)00040-0 Robertson, 1991, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52, 153, 10.1016/0095-8956(91)90061-N Takács, 1990, On the number of distinct forests, SIAM J. Discrete Math., 3, 574, 10.1137/0403050 Takahashi, 1994, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, Discrete Math., 127, 293, 10.1016/0012-365X(94)90092-2 Takahashi, 1995, Mixed searching and proper-path-width, Theoret. Comput. Sci., 137, 253, 10.1016/0304-3975(94)00160-K