{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:10:16Z","timestamp":1773616216516,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10878-012-9586-4","type":"journal-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T07:14:07Z","timestamp":1358838847000},"page":"774-786","source":"Crossref","is-referenced-by-count":29,"title":["Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable"],"prefix":"10.1007","volume":"28","author":[{"given":"Lingji","family":"Xu","sequence":"first","affiliation":[]},{"given":"Zhengke","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Yingqian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"issue":"2","key":"9586_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen LJ, Cowen RH, Woodall DR (1986) Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J Graph Theory 10(2):187\u2013195","journal-title":"J Graph Theory"},{"key":"9586_CR2","first-page":"79","volume":"25","author":"N Eaton","year":"1999","unstructured":"Eaton N, Hull T (1999) Defective list colorings of planar graphs. Bull Inst Combinatorics Appl 25:79\u201387","journal-title":"Bull Inst Combinatorics Appl"},{"key":"9586_CR3","doi-asserted-by":"crossref","unstructured":"S\u0306krekovski R, (1999) List improper coloring of planar graphs. Combinatorics Probab Comput 8:293\u2013299","DOI":"10.1017\/S0963548399003752"},{"key":"9586_CR4","doi-asserted-by":"crossref","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. Quo Vadis, Graph Theory? Ann Discret Math 55:211\u2013248","journal-title":"Ann Discret Math"},{"issue":"1","key":"9586_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/06066093X","volume":"23","author":"B Xu","year":"2009","unstructured":"Xu B (2009) On (3; 1)-coloring of plane graphs. SIAM J Discret Math 23(1):205\u2013220","journal-title":"SIAM J Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9586-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9586-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9586-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:20Z","timestamp":1559276600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9586-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9586"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9586-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,23]]}}}