I. Nengah Suparta, Mathiyazhagan Venkathacalam, I Gede Aris Gunadi, Putu Andi Cipta Pratama
|
|
|
References
|
|
|
1. |
Alfarisi R., Dafik, Prihandini R. M., Adawiyah R., Albirri E. R., Agustin I. H., “Graceful Chromatic Number of Unicyclic Graphs”, J. Phys.: Conf. Ser., 1306, The 2nd Int. Conf. Math.: Education, Theory, and Application (30–31 October 2018, Sukoharjo, Indonesia). (2019), 012039 |
2. |
Asyari M. L., Agustin I. H., Nisviasari R., Adawiyah R., “On graceful chromatic number of some graphs.”, J. Phys.: Conf. Ser., 2157, The 5th Int. Conf. Combinatorics, Graph Theory, and Network Topology, ICCGANT 2021. (21–22 August 2021, Jember, Indonesia) (2022), 012013 |
3. |
Byers A. D., Graceful Colorings and Connection in Graphs, Diss. Doct. at Western Michigan University, Dissertations, no. 3308, 2018 URL: https://scholarworks.wmich.edu/dissertations/3308 |
4. |
English E., Zhang P., Kalamazoo, “On graceful colourings of trees”, Math. Bohem., 142:1 (2016), 57–73 URL: http://dml.cz/dmlcz/146009 |
5. |
Gallian J. A., “A dynamic survey of graph labeling”, Electron. J. Combin., 24 (2021), 1–623 URL: https://www.combinatorics.org/files/Surveys/ds6/ds6v25-2022.pdf |
6. |
Mincu R., Obreja C., Popa A., “The graceful chromatic number for some particular classes of graphs”, Proc. 21st Int. Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), IEEE Xplore, 2019, 19492926 |