{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:01Z","timestamp":1740122461590,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T00:00:00Z","timestamp":1525651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-16-1-0316"],"award-info":[{"award-number":["H98230-16-1-0316"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11728102"],"award-info":[{"award-number":["11728102"]}],"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":[[2018,8]]},"DOI":"10.1007\/s10878-018-0298-2","type":"journal-article","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T12:33:09Z","timestamp":1525696389000},"page":"346-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Planar graphs without 4-cycles and close triangles are (2,\u00a00,\u00a00)-colorable"],"prefix":"10.1007","volume":"36","author":[{"given":"Heather","family":"Hoskins","sequence":"first","affiliation":[]},{"given":"Runrun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Vandenbussche","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5898-7344","authenticated-orcid":false,"given":"Gexin","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,7]]},"reference":[{"key":"298_CR1","doi-asserted-by":"crossref","unstructured":"Appel K, Haken W (1977a) Every planar graph is four colorable. Part I. Discharging, Illinois J. Math, 429\u2013490","DOI":"10.1215\/ijm\/1256049011"},{"key":"298_CR2","doi-asserted-by":"crossref","unstructured":"Appel K, Haken W (1977b) Every planar graph is four colorable. Part II. Reducibility, Illinois J. Math, 491\u2013567","DOI":"10.1215\/ijm\/1256049012"},{"key":"298_CR3","unstructured":"Borodin OV, Glebov A (2010) Planar Graphs with Neither 5-Cycles Nor Close 3-Cycles Are 3-Colorable, J. Graph Theory, 1\u201331"},{"key":"298_CR4","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 AR, Salavatipour MR (2005) Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. of Combin. Theory, Ser. B 93:303\u2013311","journal-title":"J. of Combin. Theory, Ser. B"},{"issue":"2","key":"298_CR5","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1016\/j.disc.2015.10.029","volume":"339","author":"M Chen","year":"2016","unstructured":"Chen M, Wang Y, Liu P, Xu J (2016) Planar graphs without cycles of length 4 or 5 are $$(2,0,0)$$ ( 2 , 0 , 0 ) -colorable. Discrete Math. 339(2):886\u2013905","journal-title":"Discrete Math."},{"key":"298_CR6","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, Kral D, Li Z, Salgado E (2017) Steinberg\u2019s Conjecture is false. J. of Combin. Theory, Ser. B 122:452\u2013456","journal-title":"J. of Combin. Theory, Ser. B"},{"issue":"2","key":"298_CR7","doi-asserted-by":"publisher","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":"298_CR8","unstructured":"Dvorak Z, Kral D, Thomas R. Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies, arXiv:0911.0885"},{"key":"298_CR9","unstructured":"Gr\u00f6tzch H (1958\/1959) Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz f\u00fcr dreikreisfreie Netze auf der Kugel. (German), Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math-Nat. 109\u2013120"},{"key":"298_CR10","doi-asserted-by":"crossref","unstructured":"Havel I (1969) On a Conjecture of B. Gr\u00fcnbaum, J. Combinatorial Theory, 184\u2013186","DOI":"10.1016\/S0021-9800(69)80054-2"},{"issue":"20","key":"298_CR11","doi-asserted-by":"publisher","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 Cycles of Length 4 or 5 are $$(3,0,0)$$ ( 3 , 0 , 0 ) colorable. Discrete Math. 313(20):2312\u20132317","journal-title":"Discrete Math."},{"issue":"1","key":"298_CR12","doi-asserted-by":"publisher","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. Discrete Math. 27(1):584\u2013596","journal-title":"SIAM J. Discrete Math."},{"key":"298_CR13","doi-asserted-by":"publisher","unstructured":"Huang Z, Li X, Yu G (2018) A relaxation of the strong Bordeaux Conjecture, J. Graph Theory, 1\u201318, https:\/\/doi.org\/10.1002\/jgt.22208","DOI":"10.1002\/jgt.22208"},{"key":"298_CR14","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.ejc.2015.04.001","volume":"49","author":"R Liu","year":"2015","unstructured":"Liu R, Li X, Yu G (2015) A relaxation of the Bordeaux Conjecture. European J. of Comb. 49:240\u2013249","journal-title":"European J. of Comb."},{"key":"298_CR15","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.disc.2015.10.037","volume":"339","author":"R Liu","year":"2016","unstructured":"Liu R, Li X, Yu G (2016) Planar graphs without 5-cycles and intersecting triangles are $$(1, 1, 0)$$ ( 1 , 1 , 0 ) -colorable. Discrete Math. 339:992\u20131003","journal-title":"Discrete Math."},{"issue":"1","key":"298_CR16","doi-asserted-by":"crossref","first-page":"#P1.57","DOI":"10.37236\/3509","volume":"22","author":"M Montassier","year":"2015","unstructured":"Montassier M, Ochem P (2015) Near-colorings: non-colorable graphs and NP-completeness. Electronic J. of Comb. 22(1):#P1.57","journal-title":"Electronic J. of Comb."},{"key":"298_CR17","doi-asserted-by":"crossref","unstructured":"Steinberg R (1993) The state of the three color problem, Quo Vadis, Graph Theory?, Ann. Discrete Math, 211\u2013248","DOI":"10.1016\/S0167-5060(08)70391-1"},{"key":"298_CR18","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/120885140","volume":"27","author":"Y Wang","year":"2013","unstructured":"Wang Y, Xu L (2013) Improper choosability of planar graphs without $$4$$ 4 -cycles. SIAM J. Discrete Math. 27:2029\u20132037","journal-title":"SIAM J. Discrete Math."},{"key":"298_CR19","doi-asserted-by":"publisher","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$$ 4 nor $$5$$ 5 is $$(1,1,0)$$ ( 1 , 1 , 0 ) -colorable. J Comb. Optim. 28:774\u2013786","journal-title":"J Comb. Optim."},{"key":"298_CR20","unstructured":"Xu B (2008) On (3,1)*-Coloring of Plane Graphs, SIAM J. Discrete Math, 205\u2013220"},{"issue":"4","key":"298_CR21","doi-asserted-by":"publisher","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)$$ ( 1 , 1 , 0 ) -colorable. J. Comb. Optim. 28(4):774\u2013786","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0298-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0298-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0298-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T17:14:43Z","timestamp":1604250883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0298-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,7]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["298"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0298-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,5,7]]},"assertion":[{"value":"7 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}