{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:08:58Z","timestamp":1649203738240},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p> It was proved in [Y. Bu and C. Shang, List 2-distance coloring of planar graphs without short cycles, Discrete Math. Algorithm. Appl. 8 (2016) 1650013] that for every planar graph with girth [Formula: see text] and maximum degree [Formula: see text] is list 2-distance [Formula: see text]-colorable. In this paper, we proved that: for every planar graph with [Formula: see text] and [Formula: see text] is list 2-distance [Formula: see text]-colorable. <\/jats:p>","DOI":"10.1142\/s1793830918500441","type":"journal-article","created":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T05:23:11Z","timestamp":1522732991000},"page":"1850044","source":"Crossref","is-referenced-by-count":0,"title":["A new result of list 2-distance coloring of planar graphs with g(G) \u2265 5"],"prefix":"10.1142","volume":"10","author":[{"given":"Tao","family":"Pan","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan, Shandong 250014, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan, Shandong 250014, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,7,30]]},"reference":[{"key":"S1793830918500441BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.10.022"},{"key":"S1793830918500441BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.06.029"},{"key":"S1793830918500441BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s11202-009-0106-4"},{"key":"S1793830918500441BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500130"},{"key":"S1793830918500441BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9409-z"},{"key":"S1793830918500441BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.07.026"},{"key":"S1793830918500441BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.11.005"},{"key":"S1793830918500441BIB008","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\/S1793830918500441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:44:36Z","timestamp":1565081076000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,30]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2018,7,30]]},"published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.1142\/S1793830918500441"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500441","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,30]]}}}