Development of combinatorial algorithms based on the χ(G) chromatic number for graph coloring issues
Mayur Jakhetemayur.jakhete@pcu.edu.inSchool of Engineering and TechnologyPimpri Chinchwad UniversityPune, Maharashtra, 412106, IndiaView full profile → , *Vimal BibhuCorresponding authorvimal.bhibu@niu.edu.inDepartment of Computer Science & EngineeringNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , Armaan Shaikharmaan.shaikh@dypvp.edu.inDepartment of Electronics and TelecommunicationPimpriDr. D. Y. Patil Institute of TechnologyPune, Maharashtra, 411018, IndiaView full profile → , Rupali Deshpanderupali.deshpande@vit.eduDepartment of Engineering, Science and HumanitiesVishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , V. Mounikamaunikav11@gmail.comDepartment of Master of Computer ApplicationsKITS Akshar Institute of TechnologyGuntur, Andhra Pradesh, 522019, IndiaView full profile → , J. Mounikajm1995@gmail.comDepartment of Information TechnologyKKR and KSR Institute of Technology and SciencesGuntur, Andhra Pradesh, 522017, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 09 Apr 2025
- Published Online:
- 15 Jan 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2480
- Pages:
- 243–251
Abstract
Keywords
Subject Classifications
References
[1] C. Obreja, “Results on graceful chromatic number for particular graphs,” in Proceedings of the 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Timișoara, Romania, pp. 109–116 (2020).
[2] L. Wang and J. Li, “Vertex reducible total coloring algorithm for random graphs,” in Proceedings of the IEEE 7th Information Technology and Mechatronics Engineering Conference (ITOEC), Chongqing, China, pp. 459–463 (2023).
[3] V. Iyer, A. Santha, and K. P. Thilagavathy, “Some results on achromatic and b-chromatic colouring of graphs of some finite rings,” in Proceedings of the 2nd International Conference on Advances in Electrical, Electronics, Communication, Computing and Automation (ICAECA), Coimbatore, India, pp. 1–5 (2023).
[4] K. P. Thilagavathy, “The b-chromatic number of amalgamation product of graphs,” in Proceedings of the 2nd International Conference on Advances in Electrical, Electronics, Communication, Computing and Automation (ICAECA), Coimbatore, India, pp. 1–4 (2023).
[5] R. Mincu, C. Obreja, and A. Popa, “The graceful chromatic number for some particular classes of graphs,” in Proceedings of the 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), p. 109–115 (2019).
[6] J. Li, S. Zhang, R. Luo, and L. Lan, “Algorithm for adjacent vertex sum reducible edge coloring of random graphs,” Engineering Letters, vol. 30, no. 2 (2022).
[7] R. R. Saxena, “Enumeration technique for set covering problems: a combinatorial approach,” Journal of Interdisciplinary Mathematics, vol. 9, no. 2, pp. 421–430 (2006).
[8] B. Sampath, D. Ayyappa, G. Kavya, B. Rabins, and K. G. Chandu, “ADGAN++: A deep framework for controllable and realistic face synthesis,” International Journal of Advanced Computer Engineering and Communication Technology, vol. 14, no. 1, pp. 30–38 (2025).
[9] X. Tang, J. Zhou, Y. Qiu, X. Liu, Y. Shi, and J. Zhao, “One edge at a time: A novel approach towards efficient transitive reduction computation on DAGs,” IEEE Access, vol. 8, pp. 38010–38022 (2020).
[10] M. Gionfriddo, “A remarkable connection between k-permutations and colourings of graphs,” Journal of Interdisciplinary Mathematics, vol. 14, no. 1, pp. 95–104 (2011).
