1. Bermond J.C.: Graceful graphs, radio antennae and French windmills, pp. 18–37. Graph Theory Comb., Pitman, San Fransisco (1979)
2. Bermond, J.C., Sotteau, D.: Graph decompositions and G-design. In: Proc. 5th British Combin. Conf. (1975) 53–72, (second series), vol. 12, pp. 25–28 (1989)
3. Chen W.C., Lü H.I., Yeh Y.N.: Operations of interlaced trees and graceful trees. Southeast Asian Bull. Math. 21, 337–348 (1997)
4. Gallian, J.A.: A dynamic survey of graph labeling. Electron. Comb. J. 16, 1–219 (2009), DS6. http://www.combinatorics.org
5. Hrnciar P., Haviar A.: All trees of diameter five are graceful. Discret. Math. 233, 133–150 (2001)