{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T11:31:21Z","timestamp":1690889481594},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02491-1","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T09:03:01Z","timestamp":1651654981000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On a List Variant of the Multiplicative 1-2-3 Conjecture"],"prefix":"10.1007","volume":"38","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9","family":"Hocquard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Lajou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Sopena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"2491_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput. 8, 7\u201329 (1999)","journal-title":"Comb. Probab. Comput."},{"issue":"22","key":"2491_CR2","doi-asserted-by":"publisher","first-page":"6434","DOI":"10.1016\/j.disc.2008.10.014","volume":"309","author":"M Anholcer","year":"2009","unstructured":"Anholcer, M.: Product irregularity strength of graphs. Discret. Math. 309(22), 6434\u20136439 (2009)","journal-title":"Discret. Math."},{"key":"2491_CR3","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1002\/jgt.20354","volume":"60","author":"T Bartnicki","year":"2009","unstructured":"Bartnicki, T., Grytczuk, J., Niwczyk, S.: Weight choosability of graphs. J. Graph Theory 60, 242\u2013256 (2009)","journal-title":"J. Graph Theory"},{"key":"2491_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.dam.2021.10.014","volume":"307","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Hocquard, H., Lajou, D., Sopena, \u00c9.: Further evidence towards the multiplicative 1-2-3 conjecture. Discret. Appl. Math. 307, 135\u2013144 (2022)","journal-title":"Discret. Appl. Math."},{"key":"2491_CR5","volume-title":"Algorithms and discrete applied mathematics. CALDAM 2022. Lecture notes in computer science","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Hocquard, H., Lajou, D., Sopena, \u00c9.: A proof of the multiplicative 1-2-3 conjecture. In: Balachandran, N., Inkulu, R. (eds.) Algorithms and discrete applied mathematics. CALDAM 2022. Lecture notes in computer science, vol. 13179. Springer, Cham (2022)"},{"key":"2491_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jctb.2021.01.008","volume":"149","author":"L Cao","year":"2021","unstructured":"Cao, L.: Total weight choosability of graphs: towards the 1-2-3-conjecture. J. Comb. Theory Ser. B 149, 109\u2013146 (2021)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2491_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.disc.2018.10.004","volume":"342","author":"L Ding","year":"2019","unstructured":"Ding, L., Duh, G.-H., Wang, G., Wong, T.-L., Wu, J., Yu, X., Zhu, X.: Graphs are $$(1,\\Delta +1)$$-choosable. Discret. Math. 342, 279\u2013284 (2019)","journal-title":"Discret. Math."},{"key":"2491_CR8","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Proceeding of the West Coast conference on combinatorics, graph theory and computing, Arcata. Congr. Numer. 26, 125\u2013157 (1979)","journal-title":"Congr. Numer."},{"issue":"2","key":"2491_CR9","first-page":"21","volume":"14","author":"M Hor\u0148\u00e1k","year":"2012","unstructured":"Hor\u0148\u00e1k, M., Wo\u017aniak, M.: On neighbour-distinguishing colourings from lists. Discrete Math. Theor. Comput. Sci. 14(2), 21\u201328 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2491_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","volume":"100","author":"M Kalkowski","year":"2010","unstructured":"Kalkowski, M., Karo\u0144ski, M., Pfender, F.: Vertex-coloring edge-weightings: towards the 1-2-3 conjecture. J. Comb. Theory Ser. B 100, 347\u2013349 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2491_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","volume":"91","author":"M Karo\u0144ski","year":"2004","unstructured":"Karo\u0144ski, M., \u0141uczak, T., Thomason, A.: Edge weights and vertex colours. J. Comb. Theory Ser. B 91, 151\u2013157 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2491_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10878-015-9952-0","volume":"33","author":"T Li","year":"2017","unstructured":"Li, T., Qu, C., Wang, G., Yu, X.: Neighbor product distinguishing total colorings. J. Comb. Optim. 33, 237\u2013253 (2017)","journal-title":"J. Comb. Optim."},{"issue":"10","key":"2491_CR13","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1016\/j.disc.2018.06.036","volume":"341","author":"Y-C Liang","year":"2018","unstructured":"Liang, Y.-C., Wong, T.-L., Zhu, X.: Graphs with maximum average degree less than $$\\frac{11}{4}$$ are $$(1,3)$$-choosable. Discret. Math. 341(10), 2661\u20132671 (2018)","journal-title":"Discret. Math."},{"issue":"6","key":"2491_CR14","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10114-020-9371-8","volume":"36","author":"Y Lu","year":"2020","unstructured":"Lu, Y., Li, C., Miao, Z.K.: Weight choosability of graphs with maximum degree $$4$$. Acta Math. Sin. English Ser. 36(6), 723\u2013732 (2020)","journal-title":"Acta Math. Sin. English Ser."},{"key":"2491_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/S0012-365X(96)00198-7","volume":"165\u2013166","author":"J Ne\u0161et\u0159il","year":"1997","unstructured":"Ne\u0161et\u0159il, J., Raspaud, A., Sopena, \u00c9.: Colorings and girth of oriented planar graphs. Discret. Math. 165\u2013166, 519\u2013530 (1997)","journal-title":"Discret. Math."},{"issue":"4","key":"2491_CR16","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1007\/s10878-012-9491-x","volume":"25","author":"H Pan","year":"2013","unstructured":"Pan, H., Yang, D.: On total weight choosability of graphs. J. Comb. Optim. 25(4), 766\u2013783 (2013)","journal-title":"J. Comb. Optim."},{"key":"2491_CR17","unstructured":"Seamone, B.: The 1-2-3 conjecture and related problems: a survey. Preprint. (2012) arXiv:1211.5122"},{"issue":"5","key":"2491_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2011.11.009","volume":"112","author":"J Skowronek-Kazi\u00f3w","year":"2012","unstructured":"Skowronek-Kazi\u00f3w, J.: Multiplicative vertex-colouring weightings of graphs. Inf. Process. Lett. 112(5), 191\u2013194 (2012)","journal-title":"Inf. Process. Lett."},{"key":"2491_CR19","doi-asserted-by":"publisher","first-page":"103227","DOI":"10.1016\/j.ejc.2020.103227","volume":"91","author":"T-L Wong","year":"2021","unstructured":"Wong, T.-L.: $$2$$-connected chordal graphs and line graphs are $$(1,5)$$-choosable. Eur. J. Comb. 91, 103227 (2021)","journal-title":"Eur. J. Comb."},{"key":"2491_CR20","unstructured":"Wong, T.-L., Zhu, X.: Total weight choosability of $$d$$-degenerate graphs. Manuscript (2013)"},{"key":"2491_CR21","unstructured":"Zhu, X.: Every Nice Graph is $$(1,5)$$-Choosable. Preprint. (2021) arXiv:2104.05410"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02491-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02491-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02491-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:46:24Z","timestamp":1654814784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02491-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2491"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02491-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"25 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"88"}}