{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:19:13Z","timestamp":1783185553909,"version":"3.54.6"},"reference-count":20,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.disc.2026.115206","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:22:26Z","timestamp":1778570546000},"page":"115206","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Every planar graph without 4- and 6-cycles is (2,5)-colorable"],"prefix":"10.1016","volume":"349","author":[{"given":"Kaiyang","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingfang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115206_br0010","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jctb.2013.10.002","article-title":"Defective 2-colorings of sparse graphs","volume":"104","author":"Borodin","year":"2014","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.disc.2026.115206_br0020","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/jgt.22039","article-title":"(1,k)-coloring of graphs with girth at least five on a surface","volume":"84","author":"Choi","year":"2017","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.disc.2026.115206_br0030","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.disc.2014.11.012","article-title":"Planar graphs with girth at least 5 are (3,5)-colorable","volume":"338","author":"Choi","year":"2015","journal-title":"Discrete Math."},{"issue":"12","key":"10.1016\/j.disc.2026.115206_br0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2019.06.033","article-title":"Planar graphs with girth at least 5 are (3,4)-colorable","volume":"342","author":"Choi","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115206_br0050","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.jctb.2016.07.006","article-title":"Steinberg's conjecture is false","volume":"122","author":"Cohen-Addad","year":"2017","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"10.1016\/j.disc.2026.115206_br0080","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/jgt.20155","article-title":"Improper choosability of graphs and maximum average degree","volume":"52","author":"Havet","year":"2006","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115206_br0060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2025.04.018","article-title":"An (F3,F4)-partition of planar graphs without 4- and 6-cycles","volume":"373","author":"Hu","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115206_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114626","article-title":"An (F2,F6)-partition of planar graphs without cycles of length 4 and 6","volume":"348","author":"Huang","year":"2025","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.disc.2026.115206_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112818","article-title":"Every planar graph with girth at least 5 is (1,9)-colorable","volume":"345","author":"Li","year":"2022","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.disc.2026.115206_br0100","doi-asserted-by":"crossref","DOI":"10.1007\/s00373-023-02713-0","article-title":"Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable","volume":"39","author":"Li","year":"2023","journal-title":"Graphs Comb."},{"issue":"3","key":"10.1016\/j.disc.2026.115206_br0110","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1007\/s40840-019-00819-4","article-title":"Every planar graph without 4-cycles and 5-cycles is (2,6)-colorable","volume":"43","author":"Liu","year":"2020","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"4","key":"10.1016\/j.disc.2026.115206_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.113306","article-title":"The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles","volume":"346","author":"Liu","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115206_br0130","first-page":"659","article-title":"Every planar graph without 4-cycles and 6-cycles is (2,9)-colorable","volume":"48","author":"Ma","year":"2022","journal-title":"Ital. J. Pure Appl. Math."},{"key":"10.1016\/j.disc.2026.115206_br0140","first-page":"1","article-title":"Near-colorings: non-colorable graphs and NP-completeness","volume":"22","author":"Montassier","year":"2015","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115206_br0150","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.dam.2024.05.015","article-title":"Planar graphs without 4- and 6-cycles are (3,4)-colorable","volume":"356","author":"Nakprasit","year":"2024","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"10.1016\/j.disc.2026.115206_br0170","doi-asserted-by":"crossref","first-page":"2142","DOI":"10.1016\/j.disc.2018.04.024","article-title":"Defective 2-colorings of planar graphs without 4-cycles and 5-cycles","volume":"341","author":"Sittitrai","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115206_br0160","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-5060(08)70391-1","article-title":"The state of the three color problem","volume":"55","author":"Steinberg","year":"1993","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.disc.2026.115206_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2024.128705","article-title":"Partitioning planar graphs into bounded degree forests","volume":"474","author":"Wang","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.disc.2026.115206_br0180","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1360\/012012-70","article-title":"Improper colorability of planar graphs with cycles of length neither 4 nor 6","volume":"43","author":"Xu","year":"2013","journal-title":"Sci. Sin., Math."},{"key":"10.1016\/j.disc.2026.115206_br0190","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1007\/s10878-016-0010-3","article-title":"A sufficient condition for planar graphs with girth 5 to be (1,7)-colorable","volume":"33","author":"Zhang","year":"2017","journal-title":"J. Comb. Optim."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600230X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600230X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:07:24Z","timestamp":1783184844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X2600230X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":20,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0012365X2600230X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115206","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Every planar graph without 4- and 6-cycles is (2,5)-colorable","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115206","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115206"}}