{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:16Z","timestamp":1740122416362,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12031018"],"award-info":[{"award-number":["12031018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10878-023-01099-2","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T12:02:12Z","timestamp":1704456132000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Alon\u2013Tarsi number of semi-strong product of graphs"],"prefix":"10.1007","volume":"47","author":[{"given":"Lin","family":"Niu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9328-0766","authenticated-orcid":false,"given":"Xiangwen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"issue":"2","key":"1099_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon N, Tarsi M (1992) Colorings and orientations of graphs. Combinatorica 12(2):125\u2013134","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"1099_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N (1999) Combinatorial Nullstellensatz. Comb Probab Comput 8(1\u20132):7\u201329","journal-title":"Comb Probab Comput"},{"key":"1099_CR3","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.ejc.2009.11.013","volume":"31","author":"W Cushing","year":"2010","unstructured":"Cushing W, Kierstead HA (2010) Planar graphs are 1-relaxed, 4-choosable. Eur J Combin 31:1385\u20131397","journal-title":"Eur J Combin"},{"key":"1099_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jctb.2020.02.005","volume":"145","author":"J Grytczuk","year":"2020","unstructured":"Grytczuk J, Zhu X (2020) Alon\u2013Tarsi number of planar graphs minus a matching. J Combin Theory Ser B 145:511\u2013520","journal-title":"J Combin Theory Ser B"},{"issue":"6","key":"1099_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.jctb.2010.12.007","volume":"101","author":"D Hefetz","year":"2011","unstructured":"Hefetz D (2011) On two generalizations of the Alon\u2013Tarsi polynomial method. J Combin Theory Ser B 101(6):403\u2013414","journal-title":"J Combin Theory Ser B"},{"key":"1099_CR6","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.1016\/j.disc.2010.07.019","volume":"310","author":"J Hladk\u00fd","year":"2010","unstructured":"Hladk\u00fd J, Kr\u00e1l D, Schauz U (2010) Brooks\u2019 theorem via the Alon\u2013Tarsi theorem. Discrete Math 310:3426\u20133428","journal-title":"Discrete Math"},{"key":"1099_CR7","volume-title":"Graph coloring problems","author":"T Jensen","year":"1995","unstructured":"Jensen T, Toft B (1995) Graph coloring problems. Wiley, New York"},{"key":"1099_CR8","unstructured":"Kim R, Kim S-J, Zhu X (2019) The Alon\u2013Tarsi number of subgraphs of a planar graph. arXiv:1906.01506"},{"issue":"1","key":"1099_CR9","doi-asserted-by":"publisher","first-page":"P1.3","DOI":"10.37236\/7740","volume":"26","author":"H Kaul","year":"2019","unstructured":"Kaul H, Mudrock JA (2019) On the Alon\u2013Tarsi number and chromatic-choosability of cartesian products of graphs. Electron J Combin 26(1):P1.3","journal-title":"Electron J Combin"},{"issue":"5","key":"1099_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111797","volume":"343","author":"H Lu","year":"2020","unstructured":"Lu H, Zhu X (2020) The Alon\u2013Tarsi number of planar graphs without cycles and length $$4$$ and $$l$$. Discrete Math 343(5):111797","journal-title":"Discrete Math"},{"key":"1099_CR11","doi-asserted-by":"crossref","unstructured":"Li Z, Shao Z, Petrov F, Gordeev A (2023) The Alon\u2013Tarsi number of a toroidal grid. Eur J Combin 103697","DOI":"10.1016\/j.ejc.2023.103697"},{"issue":"4","key":"1099_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2140\/moscow.2021.10.271","volume":"10","author":"F Petrov","year":"2022","unstructured":"Petrov F, Gordeev A (2022) Alon-Tarsi numbers of direct products. Mosc. J. Comb. Number Theory 10(4):271\u2013279","journal-title":"Mosc. J. Comb. Number Theory"},{"issue":"1","key":"1099_CR13","doi-asserted-by":"publisher","first-page":"R10","DOI":"10.37236\/734","volume":"15","author":"U Schauz","year":"2008","unstructured":"Schauz U (2008) Algebraically solvable problems: describing polynomials as equivalent to explicit solutions. Electron J Combin 15(1):R10","journal-title":"Electron J Combin"},{"issue":"3","key":"1099_CR14","doi-asserted-by":"publisher","first-page":"P3.43","DOI":"10.37236\/4084","volume":"21","author":"U Schauz","year":"2014","unstructured":"Schauz U (2014) Proof of the list edge coloring conjecture for complete graphs of prime degree. Electron J Combin 21(3):P3.43","journal-title":"Electron J Combin"},{"issue":"1","key":"1099_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C Thomassen","year":"1994","unstructured":"Thomassen C (1994) Every planar graph is 5-choosable. J Combin Theory Ser B 62(1):180\u2013181","journal-title":"J Combin Theory Ser B"},{"key":"1099_CR16","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.jctb.2018.06.004","volume":"134","author":"X Zhu","year":"2019","unstructured":"Zhu X (2019) The Alon-Tarsi number of planar graphs. J Comb Theory Ser B 134:354\u2013358","journal-title":"J Comb Theory Ser B"},{"key":"1099_CR17","doi-asserted-by":"crossref","unstructured":"Zhu X, Balakrishnan R (2021) Alon\u2013Tarsi theorem and its applications","DOI":"10.1201\/9781003138679-3"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01099-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01099-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01099-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T12:11:38Z","timestamp":1706184698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01099-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1099"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01099-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"12 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1"}}