{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:35Z","timestamp":1740155975352,"version":"3.37.3"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["11771403"],"award-info":[{"award-number":["11771403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:p> The [Formula: see text]-2-distance coloring of graph [Formula: see text] is a mapping [Formula: see text] if any two vertices at distance at most two from each other get different colors. The 2-distance chromatic number is the smallest integer [Formula: see text] such that [Formula: see text] has a [Formula: see text]-[Formula: see text]-distance coloring, denoted by [Formula: see text]. The purpose of this paper is to prove that every planar graph [Formula: see text] without [Formula: see text]-cycle and intersecting [Formula: see text]-cycle and [Formula: see text] has [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830921500075","type":"journal-article","created":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T10:14:49Z","timestamp":1597572889000},"page":"2150007","source":"Crossref","is-referenced-by-count":3,"title":["2-Distance coloring of planar graph"],"prefix":"10.1142","volume":"13","author":[{"given":"Yue Hua","family":"Bu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"},{"name":"Xingzhi College of Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}]},{"given":"Jiao Jiao","family":"Cao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,10,10]]},"reference":[{"key":"S1793830921500075BIB001","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"Agnarsson G.","year":"2003","journal-title":"SIAM J. Discrete Math."},{"key":"S1793830921500075BIB002","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.jctb.2018.06.005","volume":"134","author":"Bonamy M.","year":"2019","journal-title":"J. Comb. Theory Ser. B"},{"key":"S1793830921500075BIB003","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.disc.2013.10.022","volume":"317","author":"Bonamy M.","year":"2014","journal-title":"Discrete Math."},{"key":"S1793830921500075BIB005","doi-asserted-by":"crossref","first-page":"6496","DOI":"10.1016\/j.disc.2009.06.029","volume":"309","author":"Borodin O. V.","year":"2009","journal-title":"Discrete Math."},{"key":"S1793830921500075BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500130"},{"key":"S1793830921500075BIB007","first-page":"145","author":"Bu Y. H.","year":"2019","journal-title":"Adv. Math."},{"key":"S1793830921500075BIB008","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1007\/s10878-013-9700-2","volume":"30","author":"Bu Y. H.","year":"2015","journal-title":"J. Comb. Optim."},{"volume-title":"-Labeling and -Dynamic Coloring","year":"2019","author":"Bu Y. H.","key":"S1793830921500075BIB009"},{"issue":"4","key":"S1793830921500075BIB010","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1007\/s10878-017-0148-7","volume":"34","author":"Dong W.","year":"2017","journal-title":"J. Comb. Optim."},{"key":"S1793830921500075BIB011","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"Molly M.","year":"2005","journal-title":"J. Comb. Theory Ser. B"},{"key":"S1793830921500075BIB012","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"van den Heuvel J.","year":"2003","journal-title":"J. Graph Theory"},{"key":"S1793830921500075BIB013","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"Wang W. F.","year":"2003","journal-title":"SIAM J. Discrete Math."},{"key":"S1793830921500075BIB015","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1007\/s10878-018-0312-8","volume":"36","author":"Zhu H.","year":"2018","journal-title":"J. Comb. Optim."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T16:56:26Z","timestamp":1612803386000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,10]]},"references-count":13,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10.1142\/S1793830921500075"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500075","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,10,10]]}}}