1. G. Brinkmann, Fast generation of cubic graphs. J. Graph Theory 23(2), 139–149 (1996)
2. Z. Du, Wiener indices of trees and monocyclic graphs with given bipartition. Int. J. Quantum Chem. 112, 1598–1605 (2012)
3. I.A. Faradžev, Constructive enumeration of combinatorial objects, in Colloques Internationaux C.N.R.S. No260—Problèmes Combinatoires et Théorie des Graphes, (Orsay, 1976), pp. 131–135
4. R. Grund, Konstruktion schlichter graphen mit gegebener gradpartition. Bayreuth. Math. Schriften 44, 73–104 (1993)
5. G. Li, F. Ruskey, The advantages of forward thinking in generating rooted and free trees, in 100th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (1999), pp. 939–940