{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:01Z","timestamp":1759063561550},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> A [Formula: see text]-hued coloring of a graph [Formula: see text] is a proper [Formula: see text]-coloring [Formula: see text] such that [Formula: see text] for any vertex [Formula: see text]. The [Formula: see text]-hued chromatic number of [Formula: see text], written [Formula: see text], is the minimum integer [Formula: see text] such that [Formula: see text] has a [Formula: see text]-hued coloring. In this paper, we show that [Formula: see text] if [Formula: see text] and [Formula: see text] is a planar graph without [Formula: see text]-cycles or if [Formula: see text] is a planar graph without [Formula: see text]-cycles and no [Formula: see text]-cycle is intersect with [Formula: see text]-cycles, [Formula: see text], then [Formula: see text], where [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500342","type":"journal-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T07:18:32Z","timestamp":1582096712000},"page":"2050034","source":"Crossref","is-referenced-by-count":1,"title":["r-Hued coloring of planar graphs without short cycles"],"prefix":"10.1142","volume":"12","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":"Xiaofang","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang, 321004, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"key":"S1793830920500342BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830920500342BIB002","doi-asserted-by":"publisher","DOI":"10.33915\/etd.1397"},{"key":"S1793830920500342BIB003","first-page":"193","volume":"68","author":"Lai H. J.","year":"2003","journal-title":"Ars. Combin."},{"key":"S1793830920500342BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.05.015"},{"key":"S1793830920500342BIB005","first-page":"308","volume":"29","author":"Zhu H. Y.","year":"2016","journal-title":"Math. Appl."},{"issue":"2","key":"S1793830920500342BIB006","first-page":"208","volume":"44","author":"Bu Y. H.","year":"2015","journal-title":"Advances in Math."},{"key":"S1793830920500342BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.10.001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T10:50:17Z","timestamp":1594205417000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":7,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S1793830920500342"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500342","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}