References
- WestD.B., Introduction to Graph Theorysecond ed.2001Prentice Hall of India
- G. Ringel, Problem 25, in: Theory of Graphs and its Applications, 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, 19661967Gordon and Breach, N.Y. and Dunod Paris349–355
- GolombS.W., How to number a graphReadR.C.Graph Theory and Computing1972Academic PressNew York23–37
- TruszczynskiM., Graceful unicyclic graphs Demonstatio Math. 171984 377–387
- BarrientosC., Graceful graphs with pendant edges Australas. J. Combin. 332005 99–107
- BaggaJayArumurugamS., New classes of graceful unicyclic graphs Electron. Notes Discrete Math. 482015 27–32
- Figueroa-CentenoR.IchishimaR.Muntaner-BatleF.OshimaA., Gracefully cultivating trees on a cycle Electron. Notes Discrete Math. 482015 143–150
- GallianJ.A., A dynamic survey of graph labeling Electron. J. Combin. 202017 DS6
- AcharyaB.D., Construction of certain infinite families of graceful graphs from a given graceful graph Def. Sci. J. 321982 231–236
- SethuramanG.ElumalaiA., Packing of any set of graphs into a graceful/harmonious/elegant graph Ars Combin. 762005 297–301
- SethuramanG.RagukumarP.SlaterPeter J., Embedding an arbitrary tree in a graceful tree Bull. Malays. Math. Sci. Soc. 392016 341–360