{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T06:02:38Z","timestamp":1776060158813,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP25KJ2077"],"award-info":[{"award-number":["JP25KJ2077"]}],"id":[{"id":"10.13039\/501100001691","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":[[2026,6]]},"DOI":"10.1007\/s00373-026-03041-9","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T05:33:37Z","timestamp":1776058417000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Odd coloring of signed graphs"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4251-8719","authenticated-orcid":false,"given":"Pie D\u00e9sir\u00e9","family":"\u00c9bod\u00e9 Atangana","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8710-169X","authenticated-orcid":false,"given":"Masaki","family":"Kashima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,13]]},"reference":[{"key":"3041_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.7151\/dmgt.2371","volume":"43","author":"A Aashtab","year":"2023","unstructured":"Aashtab, A., Akbari, A., Ghanbari, M.: Vertex partitioning into odd induced subgraphs. Discuss. Math. Graph Theory 43, 385\u2013399 (2023)","journal-title":"Discuss. Math. Graph Theory"},{"key":"3041_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.dam.2022.07.024","volume":"321","author":"Y Caro","year":"2022","unstructured":"Caro, Y., Petru\u0161evski, M., \u0160krekovski, R.: Remarks on odd colorings of graphs. Discrete Appl. Math. 321, 394\u2013401 (2022)","journal-title":"Discrete Appl. Math."},{"key":"3041_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113305","volume":"346","author":"E-K Cho","year":"2023","unstructured":"Cho, E.-K., Choi, I., Kwon, H., Park, B.: Odd coloring of sparse graphs and planar graphs. Discrete Math. 346, 113305 (2023)","journal-title":"Discrete Math."},{"issue":"4","key":"3041_CR4","first-page":"439","volume":"15","author":"DW Cranston","year":"2024","unstructured":"Cranston, D.W.: Odd colorings of sparse graphs. J. Combin. 15(4), 439\u2013450 (2024)","journal-title":"J. Combin."},{"key":"3041_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2023.01.011","volume":"330","author":"DW Cranston","year":"2023","unstructured":"Cranston, D.W., Lafferty, M., Song, Z.-X.: A note on odd colorings of 1-planar graphs. Discrete Appl. Math. 330, 112\u2013117 (2023)","journal-title":"Discrete Appl. Math."},{"key":"3041_CR6","first-page":"332","volume":"24","author":"PJ Heawood","year":"1890","unstructured":"Heawood, P.J.: Map Colour Theorem. Quart J. Math. 24, 332\u2013338 (1890)","journal-title":"Quart J. Math."},{"key":"3041_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103215","volume":"91","author":"F Kardo\u0161","year":"2021","unstructured":"Kardo\u0161, F., Narboni, J.: On the 4-color theorem for signed graphs. European J. Combin. 91, 103215 (2021)","journal-title":"European J. Combin."},{"key":"3041_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.37236\/4938","volume":"23","author":"E M\u00e1\u010dajov\u00e1","year":"2016","unstructured":"M\u00e1\u010dajov\u00e1, E., Respaud, A., \u0160koviera, M.: The chromatic number of a signed graph. Electron. J. Combin. 23, 14 (2016)","journal-title":"Electron. J. Combin."},{"key":"3041_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00373-023-02617-z","volume":"39","author":"J Petr","year":"2023","unstructured":"Petr, J., Portier, J.: The odd chromatic number of a planar graph is at most 8. Graphs Combin. 39, 28 (2023)","journal-title":"Graphs Combin."},{"key":"3041_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.dam.2022.07.018","volume":"321","author":"M Petru\u0161evski","year":"2022","unstructured":"Petru\u0161evski, M., \u0160krekovski, R.: Colorings with neighborhood parity condition. Discrete Appl. Math. 321, 385\u2013391 (2022)","journal-title":"Discrete Appl. Math."},{"key":"3041_CR11","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.60.2.438","volume":"60","author":"G Ringel","year":"1968","unstructured":"Ringel, G., Youngs, J.W.T.: Solution of the Heawood map-coloring problem. Proc. Nat. Acad. Sci. U.S.A. 60, 438\u2013445 (1968)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"3041_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s003730170028","volume":"17","author":"AD Scott","year":"2001","unstructured":"Scott, A.D.: On induced subgraphs with all degrees odd. Graphs Combin. 17, 539\u2013553 (2001)","journal-title":"Graphs Combin."},{"key":"3041_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2023.106384","volume":"182","author":"F Tian","year":"2023","unstructured":"Tian, F., Yin, Y.: The odd chromatic number of a toroidal graph is at most 9. Inform. Process. Lett. 182, 106384 (2023)","journal-title":"Inform. Process. Lett."},{"key":"3041_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.dam.2023.11.039","volume":"345","author":"T Wang","year":"2024","unstructured":"Wang, T., Yang, X.: On odd colorings of sparse graphs. Discrete Appl. Math. 345, 156\u2013169 (2024)","journal-title":"Discrete Appl. Math."},{"key":"3041_CR15","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03041-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03041-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03041-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T05:33:47Z","timestamp":1776058427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03041-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,13]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3041"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03041-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,13]]},"assertion":[{"value":"2 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"47"}}