References
- West D.B. Introduction to Graph Theory second ed. 2001 Prentice Hall of India
- Ringel G. Problem 25 Theory of Graphs and Its Applications Proc. Symposium Smolenice, Prague (1963) 162.
- Kotzig A. Decompositions of a complete graph into 4k-gons Matematicky Casopis 15 1965 229 233 (in Russian)
- Rosa A. On certain valuations of the vertices of a graph Theory of Graphs, International Symposium, Rome, July 1966 1967 Gordon and Breach N.Y. and Dunod Paris 349 355
- Golomb S.W. How to number a graph Read R.C. Graph Theory and Computing 1972 Academic Press New York 23 37
- Aldred R.E. Mckay B.D. Graceful and harmonious labelings of trees Bull. Inst. Combin. Appl. 23 1998 69 72
- Michael Horton, Graceful Trees Statistics and Algorithms (Master’s thesis), http://eprints.comp.utas.edu.au:81/archieve/00000019/01/
- W. Fang, A computational approach to the graceful tree conjecture, http://arxiv:1003.3045v1[cs.DM]
- Ng H.K. Gracefulness of a class of lobsters Notices Amer. Math. Soc. 7 1986 825-05-294
- Wang J.G. Jin D.J. Lu X.G. Zhang D. The gracefulness of a class of lobster trees Math. Comput. Modelling 20 1994 105 110
- W.C. Chen, H.I. Lu, Y.N. Yeh, Operations of interlaced trees and graceful trees, Southeast Asian Bull. Math. 21 337–348
- Jeba Jesintha J. Sethuraman G. All arbitrary fixed generalized banana trees are graceful Math. Comput. Sci. 5 2011 1, 51 62
- Pastel A.M. Raynaud H. Numerotation gracieuse des olivers Colloq. Grenoble 1978 Publications Universite de Grenoble 218 223
- Bermond J.C. Sotteau D. Graph decompositions and G-design Proc. 5th British Combin. Conf., 53–72 (second series), vol. 12 1989 25 28
- Hrnčiar P. Haviar A. All trees of diameter five are graceful Discrete Math. 233 2001 133 150
- Balbuena C. Garcia-Vazquez P. Marcote X Valenzuela J.C. Trees having an even or quasi even degree sequence are graceful Appl. Math. Lett. 20 2007 370 375
- Koh K.H. Rogers D.G. Tan T. Two theorems on graceful trees Discrete Math. 25 1979 141 148
- Burzio M. Ferrarese G. The subdivision graph of a graceful tree is a graceful tree Discrete Math. 181 1998 275 281
- I. Cahit, Graceful labelings of rooted complete trees, 2002, preprint
- Sethuraman G. Venkatesh S. Decomposition of complete graphs and complete bipartite graphs into α-labeled trees Ars Combin. 93 2009 371 385
- Gallian J.A. A dynamic survey of graph labeling Electron. J. Combin. 18 2015 #DS6
- Van Bussel F. Relaxed graceful labelings of trees Electron. J. Combin. 9 2002 #R4
- Slater P.J. On k-graceful graphs Proc. of the 13th S.E. Conf. on Combinatorics, Graph Theory and Computing 1982 53 57