1. H. Adler and I. Adler. A note on clique-width and tree-width on structures. Arxiv preprint arXiv:0806.0103v2, [cs.LO], 2008.
2. S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embedding in a k–tree. SIAM Journal of Algebraic Discrete Methods, 8:277–284, 1987.
3. L. Aceto, Z. Ésik, and A. Ingólfsdóttir. A fully equational proof of Parikh’s theorem. Informatique theéorique et applications, 36(2):129–153, 2002.
4. H. Bodlaender. A tourist guide through tree width. Acta Cybernetica, 11:1–23, 1993.
5. H. Bodlaender. Treewidth: Algorithmic techniques and results. In I. Privara and P. Ruzicka, editors, Proceedings of the 22th International Symposium on the Mathematical Foundation of Computer Science, MFCS’97, volume 1295 of Lecture Notes in Computer Science, pages 29–36. Springer, Berlin, 1997.