1. S. Bereg, Certifying and constructing minimally rigid graphs in the plane, in: Proceedings of the 21st Annual ACM Symposium on Computational Geometry, 2005, pp. 73–80.
2. A. Berg, T. Jordán, Algorithms for graph rigidity and scene analysis, in: Proceedings of the 11th ESA, Lecture Notes in Computer Science, vol. 2832, Springer, Berlin, 2003, pp. 78–89.
3. Introduction to Algorithms;Cormen,1990
4. Edge-disjoint branchings;Edmonds,1973
5. A note on [k,l]-sparse graphs, TR 2005-05, Egerváry Research Group;Fekete,2005