{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:16:15Z","timestamp":1758824175844},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p> An injective [Formula: see text]-coloring of a graph [Formula: see text] is a mapping c: [Formula: see text]([Formula: see text]) [Formula: see text][Formula: see text] such that [Formula: see text] whenever [Formula: see text] have a common neighbor in [Formula: see text]. A list assignment of a graph [Formula: see text] is a mapping [Formula: see text] that assigns a color list [Formula: see text] to each vertex [Formula: see text]. Given a list assignment [Formula: see text] of [Formula: see text], an injective coloring [Formula: see text] of [Formula: see text] is called an injective [Formula: see text]-coloring if [Formula: see text] for every [Formula: see text]. In this paper, we show that if [Formula: see text] is a planar graph with girth [Formula: see text], then [Formula: see text] if [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830918500684","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T06:40:38Z","timestamp":1535956838000},"page":"1850068","source":"Crossref","is-referenced-by-count":6,"title":["List injective coloring of a class of planar graphs without short cycles"],"prefix":"10.1142","volume":"10","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"},{"name":"Zhejiang Normal University Xingzhi College, Jinhua, Zhejiang 321004, P. R. China"}]},{"given":"Chaoyuan","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"S1793830918500684BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.08.016"},{"key":"S1793830918500684BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830914500062"},{"key":"S1793830918500684BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9425-x"},{"key":"S1793830918500684BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.04.020"},{"key":"S1793830918500684BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00466-6"},{"key":"S1793830918500684BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.10.029"},{"issue":"1","key":"S1793830918500684BIB007","first-page":"6","volume":"39","author":"Yuehua B.","year":"2016","journal-title":"Discrete Math. J. Zhejiang Normal Univ. Nat. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T16:40:11Z","timestamp":1565196011000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":7,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2018,10,11]]},"published-print":{"date-parts":[[2018,10]]}},"alternative-id":["10.1142\/S1793830918500684"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500684","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}