{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:30Z","timestamp":1742914170948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-83438-7_2","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:52Z","timestamp":1738706212000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graceful Coloring is Computationally Hard"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7503-801X","authenticated-orcid":false,"given":"Cyriac","family":"Antony","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Antony","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8783-5630","authenticated-orcid":false,"given":"D.","family":"Laavanya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-7230","authenticated-orcid":false,"given":"S.","family":"Devi Yamini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"2_CR1","first-page":"101","volume":"101","author":"Z Bi","year":"2017","unstructured":"Bi, Z., Byers, A., English, S., Laforge, E., Zhang, P.: Graceful colorings of graphs. JCMCC J. Comb. Math. Comb. Comput. 101, 101\u2013119 (2017)","journal-title":"JCMCC J. Comb. Math. Comb. Comput."},{"issue":"1\u20136","key":"2_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"RB Borie","year":"1992","unstructured":"Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7(1\u20136), 555\u2013581 (1992). https:\/\/doi.org\/10.1007\/BF01758777","journal-title":"Algorithmica"},{"key":"2_CR3","unstructured":"Byers, A.D.: Graceful colorings and connection in graphs. Ph.D. thesis, Western Michigan University (2018)"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I: recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2020.02.010","volume":"815","author":"A Darmann","year":"2020","unstructured":"Darmann, A., D\u00f6cker, J.: On a simple hard variant of not-all-equal 3-sat. Theoret. Comput. Sci. 815, 147\u2013152 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.02.010","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"English, S., Zhang, P.: On graceful colorings of trees. Mathematica Bohemica 142(1), 57\u201373 (2017). https:\/\/doi.org\/10.21136\/MB.2017.0035-15","DOI":"10.21136\/MB.2017.0035-15"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Feder, T., Hell, P., Subi, C.: Distance-two colourings of Barnette graphs. Eur. J. Comb. 91, 15 (2021). https:\/\/doi.org\/10.1016\/j.ejc.2020.103210. id\/No 103210","DOI":"10.1016\/j.ejc.2020.103210"},{"key":"2_CR8","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 1(DynamicSurveys), DS6 (2018). 10.37236\/27"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Khoirunnisa, S., Dafik, Kristiana, A.I., Alfarisi, R., Albirri, E.R.: On graceful chromatic number of comb product of ladder graph. J. Phys. Conf. Ser. 1836(1), 012027 (2021). https:\/\/doi.org\/10.1088\/1742-6596\/1836\/1\/012027","DOI":"10.1088\/1742-6596\/1836\/1\/012027"},{"issue":"07","key":"2_CR10","doi-asserted-by":"publisher","first-page":"2350097","DOI":"10.1142\/S1793830923500970","volume":"16","author":"A Kristiana","year":"2024","unstructured":"Kristiana, A., Setyawan, D., Albirri, E., Prihandini, R., Alfarisi, R.: On graceful coloring of generalized Petersen graphs. Discrete Math. Algorithms Appl. 16(07), 2350097 (2024). https:\/\/doi.org\/10.1142\/S1793830923500970","journal-title":"Discrete Math. Algorithms Appl."},{"key":"2_CR11","unstructured":"Laavanya, D.: Graceful colorings of bipartite graph subclasses and graphs from operations: A structural and algorithmic perspective. Ph.D. thesis, Vellore Institute of Technology, Chennai, India (2024)"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Laavanya, D., Devi\u00a0Yamini, S.: Graceful coloring of some corona graphs - An algorithmic approach. Commun. Comb. Optim. (2024). https:\/\/doi.org\/10.22049\/cco.2024.29155.1866","DOI":"10.22049\/cco.2024.29155.1866"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Laavanya, D., S., D.Y.: A structural approach to the graceful coloring of a subclass of trees. Heliyon 9(9) (2023). https:\/\/doi.org\/10.1016\/j.heliyon.2023.e19563","DOI":"10.1016\/j.heliyon.2023.e19563"},{"key":"2_CR14","unstructured":"OEIS Foundation Inc.: Entry A065825 in the on-line encyclopedia of integer sequences. https:\/\/oeis.org\/A065825"},{"key":"2_CR15","unstructured":"Ringel, G.: Theory of graphs and its applications. In: Proceedings of the Symposium Smolenice, p.\u00a0162 (1963)"},{"key":"2_CR16","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs, International Symposium, Rome 1966, pp. 349\u2013355 (1967)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Suparta, I.N., Venkatachalam, M., Gunadi, I.G.A., Pratama, P.A.C.: Graceful chromatic number of some cartesian product graphs. Ural Math. J. 9(2 (17)), 193\u2013208 (2023)","DOI":"10.15826\/umj.2023.2.016"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:57Z","timestamp":1738706217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"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.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Future Directions"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}