1. Andrzejak, A.: An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discret. Math. 190(1–3), 39–54 (1998)
2. Balaji, N., Datta, S., Ganesan, V.: Counting Euler tours in undirected bounded treewidth graphs. In: Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, pp. 246–260 (2015)
3. Brightwell, G.R., Winkler, P.: Counting Eulerian circuits is #P-complete. In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, pp. 259–262 (2005)
4. Cai, J.-Y., Fu, Z., Shao, S.: A complexity trichotomy for the six-vertex model. arXiv:1704.01657 [cs.CC] (2017)
5. Cai, J.-Y., Fu, Z., Xia, M.: Complexity classification of the six-vertex model. arXiv:1702.02863 [cs.CC] (2017)