{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:10:18Z","timestamp":1773616218487,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:00:00Z","timestamp":1586131200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:00:00Z","timestamp":1586131200000},"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":["11601176"],"award-info":[{"award-number":["11601176"]}],"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":["11971196"],"award-info":[{"award-number":["11971196"]}],"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":["11671198"],"award-info":[{"award-number":["11671198"]}],"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":["11871270"],"award-info":[{"award-number":["11871270"]}],"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":["11931006"],"award-info":[{"award-number":["11931006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10878-020-00571-7","type":"journal-article","created":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T08:04:41Z","timestamp":1586160281000},"page":"45-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Planar graphs without 4- and 6-cycles are (7\u00a0:\u00a02)-colorable"],"prefix":"10.1007","volume":"40","author":[{"given":"Haitao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaojun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2548-8810","authenticated-orcid":false,"given":"Xiaolan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,6]]},"reference":[{"key":"571_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0012-365X(79)90148-1","volume":"25","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s B, Thomason A (1979) Set colorings of graphs. Discrete Math 25:21\u201326","journal-title":"Discrete Math"},{"key":"571_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jctb.2004.11.001","volume":"93","author":"OV Borodin","year":"2005","unstructured":"Borodin OV, Glebov AN, Raspaud A, Salavatipour MR (2005) Planar graphs without cycles of length from $$4$$ to $$7$$ are 3-colorable. J Comb Theory Ser B 93:303\u2013311","journal-title":"J Comb Theory Ser B"},{"key":"571_CR3","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jctb.2016.07.006","volume":"122","author":"V Cohen-Addad","year":"2017","unstructured":"Cohen-Addad V, Hebdige M, Kr\u00e1l D, Li Z, Salgadod E (2017) Steinberg\u2019s conjecture is false. J Comb Theory Ser B 122:452\u2013456","journal-title":"J Comb Theory Ser B"},{"key":"571_CR4","doi-asserted-by":"publisher","first-page":"102996, 18","DOI":"10.1016\/j.ejc.2019.07.007","volume":"82","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k Z, Hu XL (2019) Planar graphs without cycles of length 4 or 5 are $$(11:3)$$-colorable. Eur J Comb 82:102996, 18","journal-title":"Eur J Comb"},{"key":"571_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1112\/blms\/5.3.302","volume":"5","author":"AJW Hilton","year":"1973","unstructured":"Hilton AJW, Rado R, Scott SH (1973) A ($$<$$5)-color theorem for planar graphs. Bull Lond Math Soc 5:302\u2013306","journal-title":"Bull Lond Math Soc"},{"key":"571_CR6","first-page":"152","volume":"9","author":"AJW Hilton","year":"1975","unstructured":"Hilton AJW, Rado R, Scott SH (1975) Multicoloring graphs and hypergraphs. Nanta Math 9:152\u2013155","journal-title":"Nanta Math"},{"key":"571_CR7","volume-title":"Fractional graph theory: a rational approach to the theory of graphs","author":"ER Scheinerman","year":"2011","unstructured":"Scheinerman ER, Ullman DH (2011) Fractional graph theory: a rational approach to the theory of graphs. Courier Corporation, Chelmsford"},{"key":"571_CR8","unstructured":"Scott SH (1975) Multiple node colorings of finite graphs. Doctoral Dissertation, University of Reading, England"},{"key":"571_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","volume":"20","author":"S Stahl","year":"1976","unstructured":"Stahl S (1976) $$n$$-tuple colorings and associated graphs. J Comb Theory Ser B 20:185\u2013203","journal-title":"J Comb Theory Ser B"},{"key":"571_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-5060(08)70391-1","volume":"55","author":"R Steinberg","year":"1993","unstructured":"Steinberg R (1993) The state of the three color problem, in: J. Gimbel, J. W. Kennedy, L. V. Quintas (Eds.), Quo Vadis, Graph Theory? Ann. Discrete Math. 55:211\u2013248","journal-title":"Ann. Discrete Math."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00571-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00571-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00571-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T23:39:01Z","timestamp":1617665941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00571-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,6]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["571"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00571-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,6]]},"assertion":[{"value":"6 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}