{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:58:43Z","timestamp":1649069923641},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,8]],"date-time":"2013-09-08T00:00:00Z","timestamp":1378598400000},"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":[[2015,10]]},"DOI":"10.1007\/s10878-013-9653-5","type":"journal-article","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T01:27:58Z","timestamp":1378517278000},"page":"627-646","source":"Crossref","is-referenced-by-count":1,"title":["$$(1,0,0)$$ ( 1 , 0 , 0 ) -Colorability of planar graphs without prescribed short cycles"],"prefix":"10.1007","volume":"30","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[]},{"given":"Jinghan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yingqian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,8]]},"reference":[{"key":"9653_CR1","doi-asserted-by":"crossref","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 B 93:303\u2013311","journal-title":"J Comb Theory B"},{"key":"9653_CR2","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.jctb.2008.11.001","volume":"99","author":"OV Borodin","year":"2009","unstructured":"Borodin OV, Glebov AN, Montassier M, Raspaud A (2009) Planar graphs without 5- and 7-cycles without adjacent triangles are 3-colorable. J Comb Theory B 99:668\u2013673","journal-title":"J Comb Theory B"},{"key":"9653_CR3","doi-asserted-by":"crossref","unstructured":"Borodin OV, Glebov AN, Raspaud A (2010) Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discret Math 310:2584\u20132594","DOI":"10.1016\/j.disc.2010.03.021"},{"key":"9653_CR4","unstructured":"Chang GJ, Havet F, Montassier M, Raspaud A (preprint) Steinberg\u2019s Conjecture and nearing-colorings"},{"issue":"2","key":"9653_CR5","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":"9653_CR6","first-page":"109","volume":"8","author":"H Gr\u00f6tzsch","year":"1959","unstructured":"Gr\u00f6tzsch H (1959) Ein dreifarbensatz f\u00fcr dreikreisfreie netze auf der kugel. Math -nat Reihe 8:109\u2013120","journal-title":"Math -nat Reihe"},{"key":"9653_CR7","doi-asserted-by":"crossref","unstructured":"Hill O, Smith D, Wang Y, Xu L, Yu G (2013) Planar graphs without 4-cycles or 5-cycles are $$(3,0,0)$$ ( 3 , 0 , 0 ) -colorable. Discret Math 313:2312\u20132317","DOI":"10.1016\/j.disc.2013.06.009"},{"key":"9653_CR8","unstructured":"Hill O, Yu G (2013) A relaxation of Steinberg\u2019s conjecture, on arXiv. http:\/\/arxiv.org\/abs\/1208.3395"},{"key":"9653_CR9","unstructured":"Kang Y, Jin L, Wang Y (submitted) Planar graphs without cycles of length 4, 6, or 9 are 3-colorable"},{"key":"9653_CR10","doi-asserted-by":"crossref","first-page":"4596","DOI":"10.1016\/j.disc.2009.02.030","volume":"309","author":"H Lu","year":"2009","unstructured":"Lu H, Wang Y, Wang W, Bu Y, Montassier M, Raspaud A (2009) On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discret Math 309:4596\u20134607","journal-title":"Discret Math"},{"issue":"4","key":"9653_CR11","doi-asserted-by":"crossref","first-page":"P775","DOI":"10.7151\/dmgt.1579","volume":"31","author":"SA Mondal","year":"2011","unstructured":"Mondal SA (2011) Planar graphs without 4-, 5- and 8-cycles are 3-colorable. Discuss Math 31(4):P775","journal-title":"Discuss Math"},{"key":"9653_CR12","doi-asserted-by":"crossref","unstructured":"Steinberg R (1993) The state of the three color problem. In: Gimbel J, Kenndy JW, Quintas LV (eds) Quo Vadis, Graph theory? Ann Diseret Math 55:211\u2013248","DOI":"10.1016\/S0167-5060(08)70391-1"},{"key":"9653_CR13","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1007\/s11425-007-0106-4","volume":"50","author":"W Wang","year":"2007","unstructured":"Wang W, Chen M (2007) Planar graphs without 4, 6, 8-cycles are 3-colorable. Sci China A 50:1552\u20131562","journal-title":"Sci China A"},{"key":"9653_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.disc.2009.08.005","volume":"310","author":"Y Wang","year":"2010","unstructured":"Wang Y, Lu H, Chen M (2010) Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. Discret Math 310:147\u2013158","journal-title":"Discret Math"},{"key":"9653_CR15","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.dam.2010.11.002","volume":"159","author":"Y Wang","year":"2011","unstructured":"Wang Y, Wu Q, Shen L (2011) Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable. Discret Appl Math 159:232\u2013239","journal-title":"Discret Appl Math"},{"key":"9653_CR16","unstructured":"Wang Y, Jin L, Kang Y (in press) Planar graphs without cycles of length from 4 to 6 are (1,0,0)-colorable. Sci Chin Math (in Chinese)"},{"key":"9653_CR17","unstructured":"Wang Y, Yang Y (submitted-a) Planar graphs without cycles of length 4, 5 or 9 are (1,0,0)-colorable"},{"key":"9653_CR18","unstructured":"Wang Y, Yang Y (submitted-b) Planar graphs with cycles of length neither 4 nor 8 are (3,0,0)-colorable"},{"key":"9653_CR19","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.ipl.2013.06.001"},{"key":"9653_CR20","unstructured":"Wang Y, Xu J (submitted) Improper colorability of planar graphs without 4-cycles"},{"key":"9653_CR21","unstructured":"Wang Y, Xu J (manuscript) Planar graphs with cycles of length neither 4 nor 9 are (3,0,0)- and (1,1,0)-colorable"},{"key":"9653_CR22","doi-asserted-by":"crossref","unstructured":"Xu L, Miao Z, Wang Y (2013) Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ ( 1 , 1 , 0 ) -colorable. J Comb Optim. doi: 10.1007\/s10878-012-9586-4","DOI":"10.1007\/s10878-012-9586-4"},{"key":"9653_CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1360\/012012-70","volume":"43","author":"L Xu","year":"2013","unstructured":"Xu L, Wang Y (2013) Improper colorability of planar graphs with cycles of length neither 4 nor 6 (in Chinese). Sci Sin Math 43:15\u201324","journal-title":"Sci Sin Math"},{"key":"9653_CR24","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1016\/j.jctb.2006.02.005","volume":"96","author":"B Xu","year":"2006","unstructured":"Xu B (2006) On 3-colorable plane graphs without 5- and 7-cycles. J Comb Theory B 96:958\u2013963","journal-title":"J Comb Theory B"},{"issue":"1","key":"9653_CR25","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"},{"key":"9653_CR26","unstructured":"Xu J, Li H, Wang Y (submitted) Planar graphs with cycles of length neither 4 nor 7 are (3,0,0)-colorable"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9653-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9653-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9653-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:21Z","timestamp":1559262201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9653-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,8]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9653"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9653-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,8]]}}}