{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:26Z","timestamp":1740107126481,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:00:00Z","timestamp":1717027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:00:00Z","timestamp":1717027200000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00373-024-02798-1","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T15:02:23Z","timestamp":1717081343000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Cordiality Game and the Game Cordiality Number"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0485-1430","authenticated-orcid":false,"given":"Elliot","family":"Krop","sequence":"first","affiliation":[]},{"given":"Aryan","family":"Mittal","sequence":"additional","affiliation":[]},{"given":"Michael C.","family":"Wigal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"issue":"9","key":"2798_CR1","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1080\/00029890.2007.11920471","volume":"114","author":"T Bartnicki","year":"2007","unstructured":"Bartnicki, T., Grytczuk, J., Kierstead, H.A., Zhu, X.: The map-coloring game. Am. Math. Monthly 114(9), 793\u2013803 (2007)","journal-title":"Am. Math. Monthly"},{"key":"2798_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-69087-8","volume-title":"Domination games played on graphs","author":"B Bre\u0161ar","year":"2021","unstructured":"Bre\u0161ar, B., Henning, M.A., Klav\u017ear, S., Rall, D.F.: Domination games played on graphs. Springer, Cham (2021)"},{"key":"2798_CR3","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/100786800","volume":"24","author":"B Bre\u0161ar","year":"2010","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: Domination game and an imagination strategy. SIAM J. Discrete Math. 24, 979\u2013991 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"2798_CR4","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs.,\u00a0Henning, M.\u00a0A., Tuza, Z.: Transversal game on hypergraphs and the $$\\frac{3}{4}$$-conjecture on the total domination game. SIAM J. Discrete Math. 30 1830\u20131847 (2016)","DOI":"10.1137\/15M1049361"},{"key":"2798_CR5","doi-asserted-by":"crossref","unstructured":"Byskov, J.M.: Maker-maker and maker-breaker games are PSPACE-complete, Technical Report RS-04-14. Department of Computer Science, Aarhus University, BRICS (2004)","DOI":"10.7146\/brics.v11i14.21839"},{"key":"2798_CR6","first-page":"201","volume":"23","author":"I Cahit","year":"1987","unstructured":"Cahit, I.: Cordial graphs: a weaker version of graceful and harmonious graphs. Ars Combin. 23, 201\u2013207 (1987)","journal-title":"Ars Combin."},{"key":"2798_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0167-5060(08)70335-2","volume":"2","author":"V Chv\u00e1tal","year":"1978","unstructured":"Chv\u00e1tal, V., Erd\u0151s, P.: Biased positional games. Ann. Discrete Math. 2, 221\u2013229 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"5","key":"2798_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112815","volume":"345","author":"S Cichacz","year":"2022","unstructured":"Cichacz, S.: On some graph-cordial Abelian groups. Discrete Math. 345(5), 112815 (2022)","journal-title":"Discrete Math."},{"issue":"22","key":"2798_CR9","doi-asserted-by":"publisher","first-page":"2518","DOI":"10.1016\/j.disc.2013.07.025","volume":"313","author":"S Cichacz","year":"2013","unstructured":"Cichacz, S., G\u00f6rlich, A., Tuza, Z.: Cordial labeling of hypertrees. Discrete Math. 313(22), 2518\u20132524 (2013)","journal-title":"Discrete Math."},{"issue":"1","key":"2798_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.5614\/ejgta.2017.5.1.3","volume":"5","author":"K Driscoll","year":"2017","unstructured":"Driscoll, K., Krop, E., Nguyen, M.: All trees are six-cordial. Electron. J. Graph Theory Appl. 5(1), 21\u201335 (2017)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"2798_CR11","doi-asserted-by":"crossref","unstructured":"Fraenkel, A.: Combinatorial games: selected bibliography with a succinct gourmet introduction electron. J. Combin. Dynam. Surveys DS2 (2012)","DOI":"10.37236\/22"},{"key":"2798_CR12","doi-asserted-by":"crossref","unstructured":"Friedli, S.,\u00a0Velenik, Y.: Statistical mechanics of lattice systems: a concrete mathematical introduction, Cambridge University Press (2017)","DOI":"10.1017\/9781316882603"},{"key":"2798_CR13","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1137\/0601045","volume":"1","author":"RL Graham","year":"1980","unstructured":"Graham, R.L., Sloane, N.J.A.: On additive bases and harmonious graphs. SIAM J. Algebraic Discrete Methods 1, 382\u2013404 (1980)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2798_CR14","doi-asserted-by":"crossref","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: Positional games (Oberwolfach Seminars), Birkhauser (2014)","DOI":"10.1007\/978-3-0348-0825-5"},{"key":"2798_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/140976935","volume":"30","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Kinnersley, W.B.: Domination game: a proof of the $$\\frac{3}{5}$$-conjecture for graphs with minimum degree at least two. SIAM J. Discrete Math. 30, 20\u201335 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"2798_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(91)90254-Y","volume":"93","author":"M Hovey","year":"1991","unstructured":"Hovey, M.: $$A$$-cordial graphs. Discrete Math. 93, 183\u2013194 (1991)","journal-title":"Discrete Math."},{"key":"2798_CR17","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/120884742","volume":"27","author":"WB Kinnersley","year":"2013","unstructured":"Kinnersley, W.B., West, D.B., Zamani, R.: Extremal problems for game domination number. SIAM J. Discrete Math. 27, 2090\u20132107 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"2798_CR18","unstructured":"Krivelevich, M.: Positional games. Proceedings of the International Congress of Mathematicians (ICM) 4, 355\u2013379 (2014)"},{"issue":"1","key":"2798_CR19","first-page":"157","volume":"80","author":"R Patrias","year":"2021","unstructured":"Patrias, R., Pechenik, O.: Path-cordial abelian groups. Australasian J. Combin. 80(1), 157\u2013166 (2021)","journal-title":"Australasian J. Combin."},{"key":"2798_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.7151\/dmgt.1626","volume":"32","author":"O Pechenik","year":"2012","unstructured":"Pechenik, O., Wise, J.: Generalized graph cordiality. Discuss. Math. Graph Theory 32, 557\u2013567 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2798_CR21","doi-asserted-by":"crossref","unstructured":"Rahman, M. L.,\u00a0Watson, T.: 6-uniform Maker-Breaker game is PSPACE-complete, Combinatorica. 1\u201318 (2023)","DOI":"10.1007\/s00493-023-00026-7"},{"key":"2798_CR22","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Sympos., Rome, 1966), New York: Gordon and Breach, 349\u2013355 (1967)"},{"issue":"2","key":"2798_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"J Schaefer","year":"1978","unstructured":"Schaefer, J.: On the complexity of some two-person perfect information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"2798_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58(1), 22\u201333 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2798_CR25","doi-asserted-by":"crossref","unstructured":"Tuza, Z.,\u00a0Zhu, X.: Topics in chromatic graph theory, volume 156 of Encyclopedia of mathematics and its applications, chapter: colouring games, pages 304\u2013326. Cambridge University Press (2015)","DOI":"10.1017\/CBO9781139519793.017"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02798-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:04:01Z","timestamp":1723230241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02798-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,30]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2798"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02798-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,5,30]]},"assertion":[{"value":"21 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"75"}}