1. Über eine der Interpolation entsprechende Darstellung der Eliminations-Resultante;Borchardt;J. Reine Angew. Math.,1860
2. G. Brightwell, P. Winkler, Counting Eulerian circuits is ♯P-complete, in: Proc. Second Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2005), 2005, pp. 259–262.
3. P. Creed, Counting and sampling problems on Eulerian graphs, PhD thesis, University of Edinburgh, 2010.
4. Parallel recognition of series-parallel graphs;Eppstein;Inform. and Comput.,1992
5. Parallel decomposition of generalized series-parallel graphs;Ho;J. Inform. Sci. Eng.,1999