References
- WestD.B., Introduction to Graph Theorysecond ed.2001Prentice Hall of India
- G. Ringel, Problem 25, in theory of graphs and its applications, in: Proc. Symposium Smolenice, Prague, 1963, p. 162.
- KotzigA., Decompositions of a complete graph into 4k-gons Matematicky Casopis 151965 229–233(in Russian)
- RosaA., On certain valuations of the vertices of a graph Theory of Graphs (International Symposium, Rome, July 1966)1966Gordon and BreachN.Y. and Dunod Paris349–355
- GolombS.W., How to number a graphReadR.C.Graph Theory and Computing1972Academic PressNew York23–37
- AldredR.E.MckayB.D., Graceful and harmonious labelings of trees Bull. Inst. Combin. Appl. 231998 69–72
- Horton Michael, 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.arXiv:1003.3045v1 [cs.DM].
- NgH.K., Gracefulness of a class of lobsters Notices AMS 71986825-05-294
- WangJ.G.JinD.J.LuX.G.ZhangD., The gracefulness of a class of lobster trees Math. Comput. Modelling 201994 105–110
- Chen,W.C., H.I. Lu, Y.N. Yeh, Operations of interlaced trees and graceful trees, Southeast Asian Bull. Math. 21 337–348.
- JebaJesintha J.SethuramanG., All arbitrary fixed generalized banana trees are graceful Math. Comput. Sci. 5 1 2011 51–62
- PastelA.M.RaynaudH., Numerotation gracieuse des olivers Colloq. Grenoble1978Publications Universite de Grenoble218–223
- J.C. Bermond, D. Sotteau, Graph decompositions and G-design, in: Proc. 5th British Combin. Conf., 53–72 (second series), vol. 12, 1989, pp. 25–28.
- PavelHavierAlfonzHavier, All trees of diameter five are graceful Discrete Math. 2332001 133–150
- BalbuenaC.Garcia-VazquezP.MarcoteX.ValenzuelaJ.C., Trees having an even or quasi even degree sequence are graceful Appl. Math. Lett. 202007 370–375
- KohK.H.RogersD.G.TanT., Two theorems on graceful trees Discrete Math. 251979 141–148
- BurzioM.FerrareseG., The subdivision graph of a graceful tree is a graceful tree Discrete Math. 1811998 275–281
- I. Cahit, Graceful labelings of rooted complete trees, preprint, 2002.
- SethuramanG.VenkateshS., Decomposition of complete graphs and complete bipartite graphs into α-labeled trees Ars Combin. 932009 371–385
- GallianJ.A., A dynamic survey of graph labeling Electron. J. Combin. 192012 #DS6
- Van BusselF., Relaxed graceful labelings of trees Electron. J. Combin. 92002 #R4
- SlaterP.J., On k-graceful graphs Proc. of the 13th S.E. Conf. on CombinatoricsGraph Theory Comput.1982 53–57
- Thomas Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, second ed., MIT Press.
- El-ZanatiS.Vanden EyndenC., Decomposition of km,n into cubes J. Combin. Des. 41996 51–67