{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T19:17:25Z","timestamp":1714245445507},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"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":["Algorithmica"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00453-021-00903-x","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:03:47Z","timestamp":1642032227000},"page":"1030-1063","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Proper Labellings of Graphs with Minimum Label Sum"],"prefix":"10.1007","volume":"84","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8217-030X","authenticated-orcid":false,"given":"Foivos","family":"Fioravantes","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,13]]},"reference":[{"key":"903_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.dam.2019.07.019","volume":"270","author":"O Baudon","year":"2019","unstructured":"Baudon, O., Bensmail, J., Hocquard, H., Senhaji, M., Sopena, E.: Edge weights and vertex colours: minimizing sum count. Discrete Appl. Math. 270, 13\u201324 (2019)","journal-title":"Discrete Appl. Math."},{"key":"903_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ejc.2015.02.031","volume":"49","author":"O Baudon","year":"2015","unstructured":"Baudon, O., Bensmail, J., Przyby\u0142o, J., Wo\u017aniak, M.: On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49, 90\u2013104 (2015)","journal-title":"Eur. J. Comb."},{"key":"903_CR3","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.dam.2017.01.031","volume":"222","author":"O Baudon","year":"2017","unstructured":"Baudon, O., Pil\u015bniak, M., Przyby\u0142o, J., Senhaji, M., Sopena, E., Wo\u017aniak, M.: Equitable neighbour-sum-distinguishing edge and total colourings. Discrete Appl. Math. 222, 40\u201353 (2017)","journal-title":"Discrete Appl. Math."},{"key":"903_CR4","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Fioravantes, F., Nisse, N.: On proper labellings of graphs with minimum label sum. In: L. Gasieniec, R. Klasing, T. Radzik (eds.) Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8\u201310, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12126, pp. 56\u201368. Springer, Berlin (2020)","DOI":"10.1007\/978-3-030-48966-3_5"},{"key":"903_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.dam.2020.09.020","volume":"289","author":"J Bensmail","year":"2021","unstructured":"Bensmail, J., Li, B., Li, B., Nisse, N.: On minimizing the maximum color for the 1\u20132\u20133 conjecture. Discrete Appl. Math. 289, 32\u201351 (2021)","journal-title":"Discrete Appl. Math."},{"key":"903_CR6","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Mc Inerney, F., Lyngsie Szabo, K.: On $$\\{a,b\\}$$-edge-weightings of bipartite graphs with odd $$a,b$$. Discussiones Mathematicae Graph Theory p (to appear) (2019)","DOI":"10.7151\/dmgt.2250"},{"issue":"1","key":"903_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"903_CR8","first-page":"1807","volume":"15","author":"G Chang","year":"2011","unstructured":"Chang, G., Lu, C., Wu, J., Yu, Q.: Vertex-coloring edge-weightings of graphs. Taiwan. J. Math. 15, 1807\u20131813 (2011)","journal-title":"Taiwan. J. Math."},{"key":"903_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1080\/07468342.1988.11973088","volume":"19","author":"G Chartrand","year":"1998","unstructured":"Chartrand, G., Erd\u00f6s, P., Oellermann, O.: How to define an irregular graph. Coll. Math. J. 19, 36\u201342 (1998)","journal-title":"Coll. Math. J."},{"key":"903_CR10","first-page":"197","volume":"64","author":"G Chartrand","year":"1986","unstructured":"Chartrand, G., Jacobon, M., Lehel, J., Oellermann, O., Ruiz, S., Saba, F.: Irregular networks. Congr. Numer. 64, 197\u2013210 (1986)","journal-title":"Congr. Numer."},{"key":"903_CR11","volume-title":"Graph Theory, 4th Edition, Graduate Texts in Mathematics","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory, 4th Edition, Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2012)"},{"key":"903_CR12","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, 45\u201350 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"903_CR13","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\u20132\u20133-conjecture. J. Comb. Theory Ser. B 100(3), 347\u2013349 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"903_CR14","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(1), 151\u2013157 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"903_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejc.2010.08.002","volume":"32","author":"H Lu","year":"2011","unstructured":"Lu, H., Yu, Q., Zhang, C.Q.: Vertex-coloring 2-edge-weighting of graphs. Eur. J. Comb. 32(1), 21\u201327 (2011)","journal-title":"Eur. J. Comb."},{"key":"903_CR16","unstructured":"Lyngsie, K.S.: On neighbour sum-distinguishing $$\\{0,1\\}$$-edge-weightings of bipartite graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018)"},{"key":"903_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2006","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55, 1\u201329 (2006)","journal-title":"J. ACM"},{"key":"903_CR18","doi-asserted-by":"crossref","unstructured":"Przyby\u0142o, J.: The 1\u20132\u20133 conjecture almost holds for regular graphs. J. Comb. Theory, Ser. B 147, 183\u2013200 (2021)","DOI":"10.1016\/j.jctb.2020.03.005"},{"key":"903_CR19","unstructured":"Seamone, B.: The 1\u20132\u20133 conjecture and related problems: a survey. CoRR (2012) http:\/\/arxiv.org\/abs\/1211.5122"},{"key":"903_CR20","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\u20132\u20133-conjecture. J. Comb. Theory Ser. B 121, 308\u2013325 (2016)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00903-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00903-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00903-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T15:08:12Z","timestamp":1647443292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00903-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,13]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["903"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00903-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,13]]},"assertion":[{"value":"8 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}
