{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:46:25Z","timestamp":1782481585610,"version":"3.54.5"},"reference-count":15,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"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,12]]},"DOI":"10.1016\/j.disc.2026.115277","type":"journal-article","created":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T15:48:41Z","timestamp":1782143321000},"page":"115277","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["On (F,F2)-partitionability of planar graphs without {4,7}-cycles"],"prefix":"10.1016","volume":"349","author":[{"given":"Gaozhen","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0908-1260","authenticated-orcid":false,"given":"Ziwen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115277_br0010","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.disc.2015.10.029","article-title":"Planar graphs without cycles of length 4 and 5 are (2,0,0)-colorable","volume":"339","author":"Chen","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115277_br0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112172","article-title":"Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests","volume":"344","author":"Cho","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115277_br0030","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"},{"key":"10.1016\/j.disc.2026.115277_br0040","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- or 6-cycles","volume":"373","author":"Hu","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115277_br0050","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/s00373-022-02605-9","article-title":"Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest","volume":"39","author":"Huang","year":"2023","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115277_br0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114955","article-title":"Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests","volume":"349","author":"Huang","year":"2026","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115277_br0060","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."},{"key":"10.1016\/j.disc.2026.115277_br0070","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.disc.2014.03.009","article-title":"Planar graphs with cycles of length neither 4 nor 7 are (3,0,0)-colorable","volume":"327","author":"Li","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115277_br0080","doi-asserted-by":"crossref","first-page":"118","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."},{"key":"10.1016\/j.disc.2026.115277_br0090","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."},{"key":"10.1016\/j.disc.2026.115277_br0100","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.115277_br0110","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.115277_br0120","author":"Sittitrai"},{"key":"10.1016\/j.disc.2026.115277_br0130","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.dam.2023.10.002","article-title":"Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition","volume":"342","author":"Tangjai","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115277_br0140","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ipl.2013.06.001","article-title":"Planar graphs with cycles of length neither 4 nor 6 are (2,0,0)-colorable","volume":"113","author":"Wang","year":"2013","journal-title":"Inf. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T12:51:53Z","timestamp":1782478313000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26003018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0012365X26003018"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115277","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On -partitionability of planar graphs without {4,7}-cycles","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115277","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":"115277"}}