Document is current
Any future updates will be listed below
-
Authors
Antony, Cyriac https://orcid.org/0000-0001-7503-801X
Antony, Jacob
Laavanya, D. https://orcid.org/0000-0001-8783-5630
Devi Yamini, S. https://orcid.org/0000-0002-7866-7230
- License Information
-
More Information
Chapter History
First Online: 5 February 2025
Future Directions
: In this article, we proved that graceful coloring is NP-hard even when the given graph is planar bipartite, regular or 2-degenerate. The complexity of checking whether a planar graph is graceful 4-colorable remains open. Providing an explicit algorithm to check whether a chordal graph is graceful 4-colorable is another future direction we are interested in.
: The authors have no competing interests to declare that are relevant to the content of this article.
Conference Information
Conference Acronym: CALDAM
Conference Name: Conference on Algorithms and Discrete Applied Mathematics
Conference City: Coimbatore
Conference Country: India
Conference Year: 2025
Conference Start Date: 12 February 2025
Conference End Date: 14 February 2025
Conference Number: 11
Conference ID: caldam2025
Conference URL: https://caldam-2025-website.vercel.app/
