{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T01:50:37Z","timestamp":1784685037091,"version":"3.55.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001697","name":"Keio University","doi-asserted-by":"publisher","award":["JPMJSP2123"],"award-info":[{"award-number":["JPMJSP2123"]}],"id":[{"id":"10.13039\/501100001697","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJER2301"],"award-info":[{"award-number":["JPMJER2301"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC12371359"],"award-info":[{"award-number":["NSFC12371359"]}],"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":["U20A2068"],"award-info":[{"award-number":["U20A2068"]}],"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":[[2024,12]]},"DOI":"10.1007\/s00373-024-02842-0","type":"journal-article","created":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T04:01:57Z","timestamp":1728705717000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Odd 4-Coloring of Outerplanar Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Masaki","family":"Kashima","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,12]]},"reference":[{"key":"2842_CR1","unstructured":"Anderson, J., Chau, H., Cho, E.-K., Crawford, N., Hartke, S.G., Heath, E., Henderschedt, O., Kwon, H., Zhang, Z.: The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs. arXiv:2401.14590 [v1]"},{"key":"2842_CR2","doi-asserted-by":"publisher","first-page":"392","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, 392\u2013401 (2022)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2842_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113221","volume":"346","author":"Y Caro","year":"2023","unstructured":"Caro, Y., Petru\u0161evski, M., \u0160krekovski, R.: Remarks on proper conflict-free colorings of graphs. Discrete Math. 346(2), 113221 (2023)","journal-title":"Discrete Math."},{"issue":"5","key":"2842_CR4","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(5), 113305 (2023)","journal-title":"Discrete Math."},{"key":"2842_CR5","unstructured":"Kashima, M., Maezawa, S., Osako, K., Ozeki, K., Tsuchiya, S.: An odd 4-coloring of a maximal outerplanar graph. Preprint"},{"issue":"8","key":"2842_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113423","volume":"346","author":"R Liu","year":"2023","unstructured":"Liu, R., Wang, W., Yu, G.: 1-planar graphs are odd 13-colorable. Discrete Math. 346(8), 113423 (2023)","journal-title":"Discrete Math."},{"key":"2842_CR7","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":"2842_CR8","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":"2842_CR9","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."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02842-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02842-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02842-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:06:48Z","timestamp":1733515608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02842-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,12]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2842"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02842-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,12]]},"assertion":[{"value":"12 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"108"}}