{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:07:18Z","timestamp":1775052438508,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T00:00:00Z","timestamp":1411430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1476-3","type":"journal-article","created":{"date-parts":[[2014,9,22]],"date-time":"2014-09-22T05:27:37Z","timestamp":1411363657000},"page":"1497-1505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distance Constraints on Short Cycles for 3-Colorability of Planar graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Yingli","family":"Kang","sequence":"first","affiliation":[]},{"given":"Yingqian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,23]]},"reference":[{"key":"1476_CR1","first-page":"203","volume":"32","author":"HL Abbott","year":"1991","unstructured":"Abbott, H.L., Zhou, B.: On small faces in 4-critical graphs. Ars Combin. 32, 203\u2013207 (1991)","journal-title":"Ars Combin."},{"key":"1476_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Spring, Berlin (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"1476_CR3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.disc.2012.11.011","volume":"313","author":"OV Borodin","year":"2013","unstructured":"Borodin, O.V.: Colorings of plane graphs: a survey. Discrete Math. 313, 517\u2013539 (2013)","journal-title":"Discrete Math."},{"key":"1476_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<183::AID-JGT7>3.0.CO;2-N","volume":"21","author":"OV Borodin","year":"1996","unstructured":"Borodin, O.V.: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. Graph. Theory 21, 183\u2013186 (1996)","journal-title":"J. Graph. Theory"},{"issue":"11","key":"1476_CR5","first-page":"13","volume":"1","author":"OV Borodin","year":"2004","unstructured":"Borodin, O.V., Glebov, A.N.: A sufficient condition for the 3-colorability of plane graphs. Diskretn Anal. Issled. Oper. Ser. 1(11), 13\u201329 (2004). (in Russian)","journal-title":"Diskretn Anal. Issled. Oper. Ser."},{"key":"1476_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20486","volume":"66","author":"OV Borodin","year":"2010","unstructured":"Borodin, O.V., Glebov, A.N.: Planar graphs with neither 5-cycle nor close 3-cycles are 3-colorable. J. Graph. Theory 66, 1\u201331 (2010)","journal-title":"J. Graph. Theory"},{"key":"1476_CR7","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1016\/j.jctb.2012.08.001","volume":"102","author":"OV Borodin","year":"2012","unstructured":"Borodin, O.V., Glebov, A.N., Jensen, T.R.: A step towards the strong version of Havel\u2019s 3 color conjecture. J. Combin. Theory Ser. B. 102, 1295\u20131320 (2012)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1476_CR8","first-page":"428","volume":"3","author":"OV Borodin","year":"2006","unstructured":"Borodin, O.V., Glebov, A.N., Jensen, T.R., Raspaud, A.: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Sib. Elektron. Mat. Izv. 3, 428\u2013440 (2006). (in Rusian)","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"1476_CR9","doi-asserted-by":"crossref","first-page":"2584","DOI":"10.1016\/j.disc.2010.03.021","volume":"310","author":"OV Borodin","year":"2010","unstructured":"Borodin, O.V., Glebov, A.N., Raspaud, A.: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Thomassen\u2019s Spec. Issue Discrete Math. 310, 2584\u20132594 (2010)","journal-title":"Thomassen\u2019s Spec. Issue Discrete Math."},{"key":"1476_CR10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.jctb.2004.11.001","volume":"93","author":"OV Borodin","year":"2005","unstructured":"Borodin, O.V., Glebov, A.N., Raspaud, A., Salavatipour, M.R.: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Combin. Theory Ser. B. 93, 303\u2013311 (2005)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1476_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.disc.2009.08.010","volume":"310","author":"OV Borodin","year":"2010","unstructured":"Borodin, O.V., Montassier, M., Raspaud, A.: Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discrete Math. 310, 167\u2013173 (2010)","journal-title":"Discrete Math."},{"key":"1476_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0095-8956(03)00025-X","volume":"88","author":"OV Borodin","year":"2003","unstructured":"Borodin, O.V., Raspaud, A.: A sufficient condition for planar graphs to be 3-colorable. J. Combin. Theory Ser. B. 88, 17\u201327 (2003)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1476_CR13","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D., Thomas, R.: Coloring planar graphs with triangles far apart. http:\/\/www.people.math.gatech.edu\/thomas\/PAP\/havel"},{"key":"1476_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013246 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"1476_CR15","unstructured":"Gr $$\\ddot{o}$$ o \u00a8 tzsch, H.: Ein Dreifarbenzatz f $$\\ddot{u}$$ u \u00a8 r dreisfreie Netze auf der Kugel, Wiss Z Martin-Luther-Univ Halle-Wittenberg Math-Natur Reihe 8, 184\u2013186 (1959)"},{"key":"1476_CR16","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0021-9800(69)80054-2","volume":"7","author":"I Havel","year":"1969","unstructured":"Havel, I.: On a conjecture of Gr $$\\ddot{u}$$ u \u00a8 nbaum B. J. Combin. Theory Ser. B. 7, 184\u2013186 (1969)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1476_CR17","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"1476_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ipl.2008.02.003","volume":"107","author":"M Montassier","year":"2008","unstructured":"Montassier, M., Raspaud, A., Wang, W., Wang, Y.: A relaxation of Havel\u2019s 3-color problem. Inform. Process. Lett. 107, 107\u2013109 (2008)","journal-title":"Inform. Process. Lett."},{"key":"1476_CR19","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/BF01787424","volume":"11","author":"DP Sanders","year":"1995","unstructured":"Sanders, D.P., Zhao, Y.: A note on the three coloring problem. Graphs Combin. 11, 92\u201394 (1995)","journal-title":"Graphs Combin."},{"key":"1476_CR20","doi-asserted-by":"crossref","unstructured":"Steinberg, R.: The state of the three color problem. In: Gimbel, J., Kenndy, J.W., Quintas, L.V. (Eds.), Quo Vadis, Graph Theory, Ann. Diserete Math. 55, 211\u2013248 (1993)","DOI":"10.1016\/S0167-5060(08)70391-1"},{"key":"1476_CR21","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s11425-010-0074-y","volume":"53","author":"Y Wang","year":"2009","unstructured":"Wang, Y., Mao, X., Lu, H., Wang, W.: On 3-colorability of planar graphs without adjacent short cycles. Sci. China Ser. A: Math. 53, 1129\u20131132 (2009)","journal-title":"Sci. China Ser. A: Math."},{"key":"1476_CR22","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1007\/s10114-005-0851-7","volume":"23","author":"B Xu","year":"2007","unstructured":"Xu, B.: On 3-colorable plane graphs without 5-circuits. Acta Math. Sinica 23, 1059\u20131062 (2007)","journal-title":"Acta Math. Sinica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1476-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1476-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1476-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,17]],"date-time":"2022-04-17T14:16:53Z","timestamp":1650205013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1476-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,23]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1476"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1476-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,23]]}}}