{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T07:01:29Z","timestamp":1768892489572,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T00:00:00Z","timestamp":1707436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T00:00:00Z","timestamp":1707436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00373-024-02758-9","type":"journal-article","created":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T16:02:11Z","timestamp":1707494531000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Inducing Degenerate Sums Through 2-Labellings"],"prefix":"10.1007","volume":"40","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":"Pierre-Marie","family":"Marcille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,9]]},"reference":[{"key":"2758_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2013.05.027","volume":"495","author":"A Ahadi","year":"2013","unstructured":"Ahadi, A., Dehghan, A., Sadeghi, M.-R.: Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495, 25\u201336 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"2758_CR2","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Hocquard, H., Marcille, P.-M.: Adding Direction Constraints to the 1-2-3 Conjecture. Preprint (2022). https:\/\/hal.archives-ouvertes.fr\/hal-03900260","DOI":"10.1016\/j.dam.2022.04.027"},{"key":"2758_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00373-020-02252-y","volume":"37","author":"J Bensmail","year":"2021","unstructured":"Bensmail, J., Li, B., Li, B.: An injective version of the 1-2-3 Conjecture. Graphs Combin. 37, 281\u2013311 (2021)","journal-title":"Graphs Combin."},{"key":"2758_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.tcs.2021.09.023","volume":"892","author":"J Bensmail","year":"2021","unstructured":"Bensmail, J., Fioravantes, F., McInerney, F.: On the role of $$3$$s for the 1-2-3 Conjecture. Theor. Comput. Sci. 892, 238\u2013257 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"2758_CR5","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1007\/s00453-021-00903-x","volume":"84","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Fioravantes, F., Nisse, N.: On proper labellings of graphs with minimum label sum. Algorithmica 84, 1030\u20131063 (2022)","journal-title":"Algorithmica"},{"key":"2758_CR6","unstructured":"Bonamy, M.: Global discharging methods for coloring problems in graphs. Ph.D. thesis, Universit\u00e9 de Montpellier, France (2015)"},{"key":"2758_CR7","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N., Hocquard, H.: Adjacent vertex-distinguishing edge coloring of graphs. In: Ne\u0161et\u0159il, J., Pellegrini, M. (eds.) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol. 16. Edizioni della Normale, Pisa (2013)","DOI":"10.1007\/978-88-7642-475-5_50"},{"key":"2758_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0012-365X(98)00393-8","volume":"206","author":"OV Borodin","year":"1999","unstructured":"Borodin, O.V., Kostochka, A.V., Ne\u0161et\u0159il, J., Raspaud, A., Sopena, \u00c9.: On the maximum average degree and the oriented chromatic number of a graph. Discrete Math. 206, 77\u201389 (1999)","journal-title":"Discrete Math."},{"key":"2758_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02760181","volume":"6","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G., Kronk, H.V., Wall, C.E.: The point-arboricity of a graph. Isr. J. Math. 6, 169\u2013175 (1968)","journal-title":"Isr. J. Math."},{"issue":"3","key":"2758_CR10","first-page":"45","volume":"13","author":"A Dudek","year":"2011","unstructured":"Dudek, A., Wajc, D.: On the complexity of vertex-coloring edge-weightings. Discrete Math. Theor. Comput. Sci. 13(3), 45\u201350 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2758_CR11","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1007\/s00373-015-1656-9","volume":"32","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Wang, G., Wu, J.: A relaxed case on 1-2-3 Conjecture. Graphs Combin. 32, 1415\u20131421 (2016)","journal-title":"Graphs Combin."},{"key":"2758_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/0402007","volume":"2","author":"SL Hakimi","year":"1989","unstructured":"Hakimi, S.L., Schmeichel, E.F.: A note on the vertex arboricity of a graph. SIAM J. Discrete Math. 2, 64\u201367 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"2758_CR13","unstructured":"Kalkowski, M.: A note on the 1,2-Conjecture. Ph.D. thesis, Adam Mickiewicz University, Poland (2009)"},{"key":"2758_CR14","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. Combin. Theory Ser. B 100, 347\u2013349 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2758_CR15","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. Combin. Theory Ser. B 91, 151\u2013157 (2004)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2758_CR16","unstructured":"Keusch, R.: A Solution to the 1-2-3 Conjecture. Preprint (2023). arXiv:2303.02611"},{"key":"2758_CR17","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1112\/jlms\/s2-9.3.459","volume":"9","author":"HV Kronk","year":"1975","unstructured":"Kronk, H.V., Mitchem, J.: Critical point arboritic graphs. J. Lond. Math. Soc. 9, 459\u2013466 (1975)","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"2758_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. J. Combin. Theory Ser. B 33(3), 265\u2013270 (1982)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2758_CR19","first-page":"101","volume":"12","author":"J Przyby\u0142o","year":"2010","unstructured":"Przyby\u0142o, J., Wo\u017aniak, M.: On a 1,2 Conjecture. Discrete Math. Theor. Comput. Sci. 12(1), 101\u2013108 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2758_CR20","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","volume":"29","author":"A Raspaud","year":"2008","unstructured":"Raspaud, A., Wang, W.: On the vertex-arboricity of planar graphs. Eur. J. Combin. 29, 1064\u20131075 (2008)","journal-title":"Eur. J. Combin."},{"key":"2758_CR21","unstructured":"Seamone, B.: The 1-2-3 Conjecture and related problems: a survey. Preprint (2012). arXiv:1211.5122"},{"key":"2758_CR22","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jctb.2016.06.010","volume":"121","author":"C Thomassen","year":"2016","unstructured":"Thomassen, C., Wu, Y., Zhang, C.-Q.: The $$3$$-flow conjecture, factors modulo $$k$$, and the 1-2-3-conjecture. J. Combin. Theory Ser. B 121, 308\u2013325 (2016)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02758-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02758-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02758-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:02:36Z","timestamp":1714240956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02758-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,9]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2758"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02758-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,9]]},"assertion":[{"value":"27 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"23"}}