{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:15Z","timestamp":1740155955689,"version":"3.37.3"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11626225"],"award-info":[{"award-number":["11626225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701541"],"award-info":[{"award-number":["11701541"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ17A010005"],"award-info":[{"award-number":["LQ17A010005"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p> An [Formula: see text]-hued coloring is a proper coloring such that the number of colors used by the neighbors of [Formula: see text] is at least [Formula: see text]. A linear [Formula: see text]-hued coloring is an [Formula: see text]-hued coloring such that each pair of color classes induces a union of disjoint paths. We study the linear list [Formula: see text]-hued chromatic number, denoted by [Formula: see text], of sparse graphs. It is clear that any graph [Formula: see text] with maximum degree [Formula: see text] satisfies [Formula: see text]. Let [Formula: see text] be the maximum average degree of a graph [Formula: see text]. In this paper, we obtain the following results: <\/jats:p><jats:p> <jats:sup>(1)<\/jats:sup> If [Formula: see text], then [Formula: see text] <jats:sup>(2)<\/jats:sup> If [Formula: see text], then [Formula: see text]. <jats:sup>(3)<\/jats:sup> If [Formula: see text], then [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830918500453","type":"journal-article","created":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T05:41:05Z","timestamp":1522993265000},"page":"1850045","source":"Crossref","is-referenced-by-count":0,"title":["Linear list r-hued coloring of sparse graphs"],"prefix":"10.1142","volume":"10","author":[{"given":"Hongping","family":"Ma","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou 221116, P. R. China"}]},{"given":"Xiaoxue","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Science, Zhejiang University of Science and Technology, Hangzhou 310023, P. R. China"}]},{"given":"Jiangxu","family":"Kong","sequence":"additional","affiliation":[{"name":"Department of Mathematics, China Jiliang University, Hangzhou 310018, P. R. China"}]},{"given":"Murong","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA"}]}],"member":"219","published-online":{"date-parts":[[2018,7,30]]},"reference":[{"key":"S1793830918500453BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.05.002"},{"key":"S1793830918500453BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.10.012"},{"key":"S1793830918500453BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830918500453BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.01.012"},{"key":"S1793830918500453BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.05.017"},{"key":"S1793830918500453BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.08.007"},{"key":"S1793830918500453BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.112"},{"key":"S1793830918500453BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.020"},{"journal-title":"Ars Combin.","year":"2017","author":"Kong J.","key":"S1793830918500453BIB009"},{"key":"S1793830918500453BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.03.052"},{"key":"S1793830918500453BIB011","first-page":"193","volume":"68","author":"Lai H.-J.","year":"2003","journal-title":"Ars Combin."},{"key":"S1793830918500453BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2008.04.003"},{"key":"S1793830918500453BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.10.001"},{"key":"S1793830918500453BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.05.015"},{"key":"S1793830918500453BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00209-4"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T05:38:07Z","timestamp":1569303487000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,30]]},"references-count":15,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2018,7,30]]},"published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.1142\/S1793830918500453"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500453","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2018,7,30]]}}}