{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:07:08Z","timestamp":1746518828118},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p> A list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex v for every v \u2208 V(G). Given a list-assignment L and integer d \u2265 0, an (L, d)*-coloring of a graph G is a mapping \u03d5 that assigns a color \u03d5(v) \u2208 L(v) to each vertex v \u2208 V(G) such that at most d neighbors of v receive color \u03d5(v). A graph is called (k,d)*-choosable, if G admits an (L, d)*-coloring for every list assignment L with |L(v)| \u2265 k for all v \u2208 V(G). In this note, it is proved that every toroidal graph, which contains neither i-cycles nor j-cycles for any subset {i, j} \u2286 {3, 4, 6}, is (3, 1)*-choosable. <\/jats:p>","DOI":"10.1142\/s1793830909000233","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:53:30Z","timestamp":1246535610000},"page":"291-297","source":"Crossref","is-referenced-by-count":3,"title":["ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS"],"prefix":"10.1142","volume":"01","author":[{"given":"WEI","family":"DONG","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer Science, Nanjing Normal University, Nanjing, 210097, P. R. China"},{"name":"Department of Mathematics, Nanjing Xiaozhuang College, Nanjing, 210017, P. R. China"}]},{"given":"BAOGANG","family":"XU","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Nanjing Normal University, Nanjing, 210097, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"rf2","first-page":"79","volume":"25","author":"Eaton N.","journal-title":"Bull. ICA"},{"key":"rf3","volume-title":"Graph Coloring Problems","author":"Jensen T.","year":"1995"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(00)00147-6"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399003752"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1017\/S096354839900396X"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00145-4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1027"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721328.012"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1137\/06066093X"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.04.042"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.023"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830909000233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:58:07Z","timestamp":1565193487000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830909000233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1142\/S1793830909000233"],"URL":"https:\/\/doi.org\/10.1142\/s1793830909000233","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}