{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T04:10:42Z","timestamp":1687320642245},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph and Algorithms","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"Graphs and Algorithms<\/jats:p>\n A proper vertex coloring of a graphGis called a star-coloring if there is no path on four vertices assigned to two colors. The graph G is L-star-colorable if for a given list assignment L there is a star-coloring c such that c(v) epsilon L(v). If G is L-star-colorable for any list assignment L with vertical bar L(v)vertical bar \\textgreater= k for all v epsilon V(G), then G is called k-star-choosable. The star list chromatic number of G, denoted by X-s(l)(G), is the smallest integer k such that G is k-star-choosable. In this article, we prove that every graph G with maximum average degree less than 3 is 8-star-choosable. This extends a result that planar graphs of girth at least 6 are 8-star-choosable [A. Kundgen, C. Timmons, Star coloring planar graphs from small lists, J. Graph Theory, 63(4): 324-337, 2010].<\/jats:p>","DOI":"10.46298\/dmtcs.561","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T21:48:59Z","timestamp":1629755339000},"source":"Crossref","is-referenced-by-count":0,"title":["8-star-choosability of a graph with maximum average degree less than 3"],"prefix":"10.46298","volume":"Vol. 13 no. 3","author":[{"given":"Min","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Mathematics [Jinhua]"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[{"name":"Laboratoire Bordelais de Recherche en Informatique"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics [Jinhua]"}]}],"member":"25203","published-online":{"date-parts":[[2011,12,31]]},"container-title":["Discrete Mathematics & Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dmtcs.episciences.org\/561\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dmtcs.episciences.org\/561\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:09:47Z","timestamp":1687291787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dmtcs.episciences.org\/561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,31]]},"references-count":0,"journal-issue":{"issue":"Graph and Algorithms","published-online":{"date-parts":[[2011,12,31]]}},"URL":"http:\/\/dx.doi.org\/10.46298\/dmtcs.561","relation":{"is-same-as":[{"id-type":"uri","id":"https:\/\/hal.science\/hal-00990482v1","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,31]]}}}
