S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms, 12 (1991), p. 308–340.
 B. Courcelle, Graph rewriting: An algebraic and logic approach, in Formal Models and Semantics, Elsevier, 1990, pp. 193–242.
 , The monadic second-order logic of graphs. i. recognizable sets of finite graphs, Information and computation, 85 (1990), pp. 12–75.
 M. Csur˝ os, J. A. Holey, and I. B. Rogozin ¨ , In search of lost introns, Bioinformatics, 23 (2007), pp. i87– i96.
 R. G. Downey and M. R. Fellows, Parameterized complexity, Springer Science & Business Media, 2012.
 S. El-Basil, Caterpillar (gutman) trees in chemical graph theory, Advances in the theory of Benzenoid hydrocarbons, (1990), pp. 273–289.
 H. B. Enderton, A mathematical introduction to logic, Elsevier, 2001.
 P. Hlinenˇ y, S.-i. Oum, D. Seese, and G. Gottlob ` , Width parameters beyond tree-width and their applcations, The computer journal, 51 (2008), pp. 326–362.
 M. Khosravani, Searching for optimal caterpillars in general and bounded treewidth graphs, PhD thesis, ResearchSpace, Auckland, 2011.
 A. Lozano, R. Y. Pinter, O. Rokhlenko, G. Valiente, and M. Ziv-Ukelson, Seeded tree alignment, IEEE/ACM transactions on Computational Biology and Bioinformatics, 5 (2008), pp. 503–513.
 M. Numan, A. Nawaz, A. Aslam, and S. I. Butt, Hosoya polynomial for subdivided caterpillar graphs, Combinatorial Chemistry & High Throughput Screening, 25 (2022), pp. 554–559.
 J. Tan and L. Zhang, The consecutive ones submatrix problem for sparse matrices, Algorithmica, 48 (2007), pp. 287–299.