{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T16:49:19Z","timestamp":1782146959932,"version":"3.54.5"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p> A 2-distance coloring of [Formula: see text] is a function [Formula: see text]: [Formula: see text], such that for every two distinct vertices [Formula: see text], [Formula: see text] in [Formula: see text], [Formula: see text] if [Formula: see text]. The 2-distance chromatic number of [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a [Formula: see text]-[Formula: see text]-distance coloring, denoted by [Formula: see text]. Similarly, the list 2-distance chromatic number of [Formula: see text] is denoted by [Formula: see text]. In this paper, we proved that: (1) for every planar graph with [Formula: see text] and [Formula: see text], [Formula: see text]; (2) for every planar graph with [Formula: see text] and [Formula: see text], [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830916500130","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T01:06:36Z","timestamp":1448931996000},"page":"1650013","source":"Crossref","is-referenced-by-count":13,"title":["List 2-distance coloring of planar graphs without short cycles"],"prefix":"10.1142","volume":"08","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"},{"name":"Xingzhi College, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunhui","family":"Shang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"S1793830916500130BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.10.022"},{"key":"S1793830916500130BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.06.029"},{"key":"S1793830916500130BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s11202-009-0106-4"},{"key":"S1793830916500130BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9700-2"},{"key":"S1793830916500130BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9409-z"},{"key":"S1793830916500130BIB007","volume":"42","author":"Bu Y.","year":"2012","journal-title":"China Sci. Math."},{"key":"S1793830916500130BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.11.005"},{"key":"S1793830916500130BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2007.07.079"},{"key":"S1793830916500130BIB010","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10077"},{"key":"S1793830916500130BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.12.005"},{"key":"S1793830916500130BIB012","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101390448"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:02:40Z","timestamp":1565107360000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,26]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,2,26]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S1793830916500130"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500130","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,26]]}}}