{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T19:29:01Z","timestamp":1773689341388,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471273"],"award-info":[{"award-number":["11471273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11561058"],"award-info":[{"award-number":["11561058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00373-019-02056-9","type":"journal-article","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T15:02:40Z","timestamp":1561215760000},"page":"1051-1064","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Alon\u2013Tarsi Number and Modulo Alon\u2013Tarsi Number of Signed Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6399-1452","authenticated-orcid":false,"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiki","family":"Abe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,22]]},"reference":[{"key":"2056_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Combin. Probab. Comput. 8, 7\u201329 (1999)","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"2056_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12(2), 125\u2013134 (1992)","journal-title":"Combinatorica"},{"key":"2056_CR3","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.: On two generalizations of the Alon\u2013Tarsi polynomial method. J. Combin. Theory Ser. B 101, 403\u2013414 (2011)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2056_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.disc.2017.09.019","volume":"341","author":"L Hu","year":"2018","unstructured":"Hu, L., Li, X.: Every signed planar graph without cycles of length from 4 to 8 is 3-colorable. Discrete Math. 341, 513\u2013519 (2018)","journal-title":"Discrete Math."},{"key":"2056_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0095-8956(92)90016-Q","volume":"56","author":"F Jaeger","year":"1992","unstructured":"Jaeger, F., Linial, N., Payan, C., Tarsi, M.: Group connectivity of graphs\u2014a nonhomogeneous analogue of nowhere-zero flow properties. J. Combin. Theory Ser. B 56, 165\u2013182 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2056_CR6","volume-title":"Graph Coloring Problems","author":"T Jensen","year":"1995","unstructured":"Jensen, T., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"2056_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ejc.2015.10.001","volume":"52","author":"L Jin","year":"2016","unstructured":"Jin, L., Kang, Y., Steffen, E.: Choosability in signed planar graphs. Eur. J. Combin. 52, 234\u2013243 (2016)","journal-title":"Eur. J. Combin."},{"key":"2056_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/jgt.22147","volume":"87","author":"Y Kang","year":"2018","unstructured":"Kang, Y., Steffen, E.: Circular coloring of signed graphs. J. Graph Theory 87, 135\u2013148 (2018)","journal-title":"J. Graph Theory"},{"key":"2056_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/jgt.20098","volume":"50","author":"D Kr\u00e1l\u2019","year":"2005","unstructured":"Kr\u00e1l\u2019, D., Pangr\u00e1c, O., Voss, H.J.: A Note on group colorings. J. Graph Theory 50, 123\u2013129 (2005)","journal-title":"J. Graph Theory"},{"key":"2056_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s003730200009","volume":"18","author":"H-J Lai","year":"2002","unstructured":"Lai, H.-J., Zhang, X.: Group chromatic number of graphs without $$K_5$$ minors. Graphs Combin. 18, 147\u2013154 (2002)","journal-title":"Graphs Combin."},{"key":"2056_CR11","doi-asserted-by":"crossref","first-page":"#P1.14","DOI":"10.37236\/4938","volume":"23","author":"E M\u00e1\u010dajov\u00e1","year":"2016","unstructured":"M\u00e1\u010dajov\u00e1, E., Raspaud, A., \u0160koviera, M.: The chromatic number of a signed graph. Electron. J. Combin. 23, #P1.14 (2016)","journal-title":"Electron. J. Combin."},{"key":"2056_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00493-005-0020-8","volume":"25","author":"R Ramamurthi","year":"2005","unstructured":"Ramamurthi, R., West, D.B.: Hypergraph extension of the Alon\u2013Tarsi list coloring theorem. Combinatorica 25, 355\u2013366 (2005)","journal-title":"Combinatorica"},{"key":"2056_CR13","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.disc.2017.01.007","volume":"340","author":"T Schweser","year":"2017","unstructured":"Schweser, T., Stiebitz, M.: Degree choosable signed graphs. Discrete Math. 340, 882\u2013891 (2017)","journal-title":"Discrete Math."},{"issue":"1","key":"2056_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C Thomassen","year":"1994","unstructured":"Thomassen, C.: Every planar graph is 5-choosable. J. Combin. Theory Ser. B 62(1), 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2056_CR15","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.: The Alon\u2013Tarsi number of planar graphs. J. Combin. Theory Ser. B 134, 354\u2013358 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2056_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(82)90144-3","volume":"39","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graph coloring. Discrete Math. 39, 215\u2013228 (1982)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02056-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02056-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02056-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T23:20:36Z","timestamp":1592695236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02056-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,22]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2056"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02056-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,22]]},"assertion":[{"value":"28 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}