{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:52:44Z","timestamp":1778611964011,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,26]],"date-time":"2016-03-26T00:00:00Z","timestamp":1458950400000},"content-version":"tdm","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":["11471293"],"award-info":[{"award-number":["11471293"]}],"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":["11271335"],"award-info":[{"award-number":["11271335"]}],"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":["11401535"],"award-info":[{"award-number":["11401535"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY14A010014"],"award-info":[{"award-number":["LY14A010014"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301035"],"award-info":[{"award-number":["11301035"]}],"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":[[2017,4]]},"DOI":"10.1007\/s10878-016-0010-3","type":"journal-article","created":{"date-parts":[[2016,3,26]],"date-time":"2016-03-26T07:24:01Z","timestamp":1458977041000},"page":"847-865","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A sufficient condition for planar graphs with girth 5 to be (1,\u00a07)-colorable"],"prefix":"10.1007","volume":"33","author":[{"given":"Miao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,26]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/jgt.20467","volume":"65","author":"OV Borodin","year":"2010","unstructured":"Borodin OV, Ivanova AO, Montassier M, Ochem P, Raspaud A (2010) Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J Graph Theory 65(2):83\u201393","journal-title":"J Graph Theory"},{"issue":"5","key":"10_CR2","first-page":"1004","volume":"52","author":"OV Borodin","year":"2011","unstructured":"Borodin OV, Kostochka AV (2011) Vertex decompositions of sparse graphs into an independent set and a subgraph of maximum degree at most 1. Sibirsk Math Zh 52(5):1004\u20131010","journal-title":"Sibirsk Math Zh"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jctb.2013.10.002","volume":"104","author":"OV Borodin","year":"2014","unstructured":"Borodin OV, Kostochka AV (2014) Defective 2-colorings of sparse graphs. J Combin Theory Ser B 104:72\u201380","journal-title":"J Combin Theory Ser B"},{"issue":"22","key":"10_CR4","first-page":"2638","volume":"313","author":"OV Borodin","year":"2013","unstructured":"Borodin OV, Kostochka A, Yancey M (2013) On 1-improper 2-coloring of sparse graphs. Comb Math 313(22):2638\u20132649","journal-title":"Comb Math"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"L Cowen","year":"1986","unstructured":"Cowen L, Cowen R, Woodall D (1986) Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J Graph Theory 10:187\u2013195","journal-title":"J Graph Theory"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.disc.2014.11.012","volume":"338","author":"I Choi","year":"2015","unstructured":"Choi I, Raspaud A (2015) Planar graphs with girth at least 5 are $$(3,5)$$ ( 3 , 5 ) -colorable. Discret Math 338:661\u2013667","journal-title":"Discret Math"},{"key":"10_CR7","first-page":"40","volume":"25","author":"N Eaton","year":"1999","unstructured":"Eaton N, Hull T (1999) Defective list colorings of planar graphs. Bull Inst Combin Appl 25:40","journal-title":"Bull Inst Combin Appl"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/jgt.20155","volume":"52","author":"F Havet","year":"2006","unstructured":"Havet F, Sereni J-S (2006) Improper choosability of graphs and maximum average degree. J Graph Theory 52:181\u2013199","journal-title":"J Graph Theory"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"2312","DOI":"10.1016\/j.disc.2013.06.009","volume":"313","author":"O Hill","year":"2013","unstructured":"Hill O, Smith D, Wang Y, Xu L, Yu G (2013) Planar graphs without 4-cycles or 5-cycles are (3,0,0)-colorable. Discret Math 313:2312\u20132317","journal-title":"Discret Math"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1137\/120888752","volume":"27","author":"O Hill","year":"2013","unstructured":"Hill O, Yu G (2013) A relaxation of Steinberg\u2019s conjecture. SIAM J Discret Math 27:584\u2013596","journal-title":"SIAM J Discret Math"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.disc.2014.03.009","volume":"327","author":"H Li","year":"2014","unstructured":"Li H, Wang Y, Xu J (2014) Planar graphs with cycles of length neither 4 nor 7 are (3,0,0)-colorable. Discret Math 327:29\u201335","journal-title":"Discret Math"},{"key":"10_CR12","unstructured":"Montassier M, Ochem P (2013) Near-colorings: non-colorable graphs and np-completness. submitted for publication"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1017\/S0963548399003752","volume":"8","author":"R \u0160rekovski","year":"1999","unstructured":"\u0160rekovski R (1999) List improper colourings of planar graphs. Comb Probab Comput 8:293\u2013299","journal-title":"Comb Probab Comput"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ipl.2013.06.001","volume":"113","author":"Y Wang","year":"2013","unstructured":"Wang Y, Xu J (2013) Planar graphs with cycles of length neither 4 nor 6 are (2,0,0)-colorable. Inform Process Lett 113:659\u2013663","journal-title":"Inform Process Lett"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.disc.2013.12.023","volume":"322","author":"Y Wang","year":"2014","unstructured":"Wang Y, Xu J (2014) Improper colorability of planar graphs without prescribed short cycles. Discret Math 322:5\u201314","journal-title":"Discret Math"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/06066093X","volume":"23","author":"B Xu","year":"2008","unstructured":"Xu B (2008) on $$(3,1)^*$$ ( 3 , 1 ) \u2217 -coloring of plane graphs. SIAM J Discret Math 23:205\u2013220","journal-title":"SIAM J Discret Math"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1007\/s10878-012-9586-4","volume":"28","author":"L Xu","year":"2014","unstructured":"Xu L, Miao Z, Wang Y (2014) Every planar graph with cycles of length neither 4 nor 5 is (1,1,0)-colorable. J Comb Optim 28:774\u2013786","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0010-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0010-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0010-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0010-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0010-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,26]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0010-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,26]]}}}