{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T15:22:22Z","timestamp":1769008942510,"version":"3.49.0"},"reference-count":23,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":49,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CAPES-PrInt","award":["88881.310248\/2018-01"],"award-info":[{"award-number":["88881.310248\/2018-01"]}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Financial Code 001"],"award-info":[{"award-number":["Financial Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2023,10,8]]},"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>A graceful labeling of a graph <jats:italic>G<\/jats:italic> with <jats:italic>m<\/jats:italic> edges consists in labeling the vertices of <jats:italic>G<\/jats:italic> with distinct integers from 0 to <jats:italic>m<\/jats:italic> such that each edge is uniquely identified by the absolute difference of the labels of its endpoints. In this work, we study the graceful labeling problem in the context of maker-breaker graph games. The Graceful Game was introduced by Tuza, in 2017, as a two-players game on a connected graph in which the players, Alice and Bob, take moves labeling the vertices with distinct integers from 0 to <jats:italic>m<\/jats:italic>. Players are constrained to use only legal labelings (moves), that is, after a move, all edge labels are distinct. Alice\u2019s goal is to obtain a graceful labeling for the graph, as Bob\u2019s goal is to prevent it from happening. In this work, we study winning strategies for Alice and Bob in graph classes: paths, complete graphs, cycles, complete bipartite graphs, caterpillars, trees, gear graphs, web graphs, prisms, hypercubes, 2-powers of paths, wheels and fan graphs.<\/jats:p>","DOI":"10.1051\/ro\/2023165","type":"journal-article","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T19:05:24Z","timestamp":1696964724000},"page":"423-439","source":"Crossref","is-referenced-by-count":3,"title":["Graceful game on some graph classes"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-3524","authenticated-orcid":false,"given":"Deise L.","family":"de Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-2740","authenticated-orcid":false,"given":"Danilo","family":"Artigas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8340-4881","authenticated-orcid":false,"given":"Simone","family":"Dantas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2498-6076","authenticated-orcid":false,"given":"Luisa","family":"Frickes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6177-403X","authenticated-orcid":false,"given":"At\u00edlio G.","family":"Luiz","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1016\/j.disc.2017.02.019","volume":"340","author":"Baudon","year":"2017","journal-title":"Discrete Math."},{"key":"R2","first-page":"67","volume":"29","author":"Boudreau","year":"2004","journal-title":"Australas. J. Comb."},{"key":"R3","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1016\/j.disc.2012.07.002","volume":"312","author":"Chia","year":"2012","journal-title":"Discrete Math."},{"key":"R4","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1051\/ro\/2009029","volume":"43","author":"Duch\u00eane","year":"2009","journal-title":"RAIRO: Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1111\/j.1749-6632.1979.tb32792.x","volume":"319","author":"Frucht","year":"1979","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"R6","first-page":"1","volume":"DS6","author":"Gallian","year":"2018","journal-title":"Electron. J. Comb."},{"key":"R7","first-page":"75","volume":"78","author":"Giambrone","year":"2011","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Golomb S.W., How to number a graph, in Graph Theory and Computing. Academic Press, New York (1972) 23\u201337.","DOI":"10.1016\/B978-1-4832-3187-7.50008-8"},{"key":"R9","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/0601045","volume":"1","author":"Graham","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"R10","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"Griggs","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"R11","first-page":"163","volume":"161","author":"Hartnell","year":"2003","journal-title":"Congressus Numerantium"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Hefetz D., Krivelevich M., Stojakovi\u0107 M., Szab\u00f3 T., Positional Games. Birkh\u00a8auser\/Springer, Basel (2014).","DOI":"10.1007\/978-3-0348-0825-5"},{"key":"R13","first-page":"311","volume":"14","author":"Hoede","year":"1987","journal-title":"Utilitas Mathematica"},{"key":"R14","first-page":"193","volume":"22","author":"Kang","year":"1996","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"R15","first-page":"1","volume":"7","author":"Varkey","year":"2016","journal-title":"Int. J. App. Graph Theory Wirel. Ad hoc Networks Sens. Networks"},{"key":"R16","first-page":"387","volume":"35","author":"Parvathi","year":"2015","journal-title":"J. Inf. Optim. Sci."},{"key":"R17","unstructured":"Rosa A., On certain valuations of the vertices of a graph, in Theory of Graphs, International Symposium, Rome, July 1966. (1967) 349\u2013355."},{"key":"R18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.4153\/CMB-1970-084-1","volume":"13","author":"Rosa","year":"1970","journal-title":"Can. Math. Bull."},{"key":"R19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. Syst. Sci."},{"key":"R20","first-page":"389","volume":"24","author":"Sethuraman","year":"2014","journal-title":"Adv. Stud. Contemp. Math."},{"key":"R21","first-page":"81","volume":"1","author":"Sudha","year":"2013","journal-title":"Eng. Sci. Int. Res. J."},{"key":"R22","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.endm.2017.06.009","volume":"60","author":"Tuza","year":"2017","journal-title":"Electron. Notes Discrete Math."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Tuza Z. and Zhu X., Colouring games, in Topics in Chromatic Graph Theory. Vol. 156 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press (2015) 304\u2013326.","DOI":"10.1017\/CBO9781139519793.017"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023165\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T08:57:39Z","timestamp":1708333059000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023165"}},"subtitle":[],"editor":[{"given":"M.B.","family":"Campelo Neto","sequence":"first","affiliation":[]},{"given":"S.","family":"Klein","sequence":"additional","affiliation":[]},{"given":"I.","family":"Loiseau","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Wakabayashi","sequence":"additional","affiliation":[]},{"given":"A.","family":"Weintraub","sequence":"additional","affiliation":[]},{"given":"V.","family":"dos Santos","sequence":"additional","affiliation":[]},{"given":"T.","family":"Liebling","sequence":"additional","affiliation":[]},{"given":"R.","family":"Mahjoub","sequence":"additional","affiliation":[]},{"given":"N.","family":"Maculan","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":23,"journal-issue":{"issue":"1"},"alternative-id":["ro220747"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2023165","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}