{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:17:06Z","timestamp":1753885026832,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"name":"Shandong Provincial Natural Science Foundation of China","award":["Grant ZR2020MA045"],"award-info":[{"award-number":["Grant ZR2020MA045"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p> The [Formula: see text]-[Formula: see text]-distance coloring of the graph [Formula: see text] refers to that it satisfies the mapping: [Formula: see text], such that the vertex [Formula: see text] and [Formula: see text], whose distance is at most [Formula: see text], receive different colors, namely [Formula: see text]. Denote [Formula: see text], which is a list 2-distance chromatic number of the graph [Formula: see text]. This paper proves that [Formula: see text] for the graph [Formula: see text] without 3-cycles and intersecting 4-cycles and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830924500125","type":"journal-article","created":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T03:47:45Z","timestamp":1706327265000},"source":"Crossref","is-referenced-by-count":0,"title":["List 2-distance coloring for planar graphs with short circle constraints"],"prefix":"10.1142","volume":"17","author":[{"given":"Mingyue","family":"Yang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Qingdao University, Qingdao, Shandong 266071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qingdao University, Qingdao, Shandong 266071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"S1793830924500125BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9700-2"},{"issue":"2","key":"S1793830924500125BIB002","first-page":"208","volume":"44","author":"Bu Y. H.","year":"2015","journal-title":"Adv. Math."},{"key":"S1793830924500125BIB003","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830922500847"},{"key":"S1793830924500125BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921500075"},{"key":"S1793830924500125BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22101"},{"key":"S1793830924500125BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.12.005"},{"key":"S1793830924500125BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10077"},{"key":"S1793830924500125BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0647-9"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830924500125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:58:54Z","timestamp":1737507534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830924500125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,29]]},"references-count":8,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1142\/S1793830924500125"],"URL":"https:\/\/doi.org\/10.1142\/s1793830924500125","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2024,2,29]]},"article-number":"2450012"}}