{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:34:34Z","timestamp":1753882474384,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:p> The k-2-distance coloring of graph G 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 k such that G has a k-2-distance coloring, denoted by [Formula: see text]. In this paper, we prove that every planar graph G without 3-cycles and intersecting 4-cycles and [Formula: see text] has [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830922500847","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T16:40:44Z","timestamp":1649781644000},"source":"Crossref","is-referenced-by-count":0,"title":["2-Distance coloring of planar graphs without triangles and intersecting 4-cycles"],"prefix":"10.1142","volume":"15","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, Zhejiang, P. R. China"},{"name":"Xingzhi college of Zhejiang Normal University, Jinhua 321004, Zhejiang, P. R. China"}]},{"given":"Zewei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, Zhejiang, P. R. China"}]},{"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, Zhejiang, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2022,4,11]]},"reference":[{"key":"S1793830922500847BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2018.06.005"},{"key":"S1793830922500847BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.06.029"},{"key":"S1793830922500847BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921500075"},{"key":"S1793830922500847BIB005","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500130"},{"key":"S1793830922500847BIB006","first-page":"145","volume":"48","author":"Bu Y. H.","year":"2019","journal-title":"Adv. Math."},{"key":"S1793830922500847BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0148-7"},{"key":"S1793830922500847BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10077"},{"key":"S1793830922500847BIB009","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1134\/S1990478911020098","volume":"5","author":"Ivanova A. O.","year":"2011","journal-title":"J. Appl. Ind. Math."},{"key":"S1793830922500847BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.12.005"},{"key":"S1793830922500847BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0312-8"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:02:13Z","timestamp":1677726133000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,11]]},"references-count":10,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10.1142\/S1793830922500847"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500847","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,4,11]]},"article-number":"2250084"}}