1. Beineke, L.W., Pippert, R.E.: The number of labeled $$k$$ k -dimensional trees. J. Comb. Theory 6(2), 200–205 (1969)
2. Bodirsky, M., Giménez, O., Kang, M., Noy, M.: Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8), 2091–2105 (2007)
3. Bodlaender, H., Kloks, T.: Only few graphs have bounded treewidth. Technical report RUU-CS-92-35, Utrecht University. Department of Computer Science (1992)
4. Bodlaender, H.L., Nederlof, J.: Subexponential time algorithms for finding small tree and path decompositions. CoRR, abs/1601.02415 (2016)
5. Bodlaender, H.L., Nederlof, J., van der Zanden, T.C.: Subexponential time algorithms for embedding $$H$$ H -minor free graphs. In: Proceedings of the 43rd International Colloquium on Automata, Languages, Programming (ICALP), volume 55 of LIPIcs, pp. 9:1–9:14 (2016)