{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T11:04:09Z","timestamp":1762254249712},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"S2","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"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":["Combinatorica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00493-021-4822-0","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T17:03:23Z","timestamp":1663779803000},"page":"1487-1512","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree"],"prefix":"10.1007","volume":"42","author":[{"given":"Jakub","family":"Przyby\u0142o","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"4822_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-007-0041-6","volume":"27","author":"L Addario-Berry","year":"2007","unstructured":"L. Addario-Berry, K. Dalal, C. McDiarmid, B. A. Reed and A. Thomason: Vertex-Colouring Edge-Weightings, Combinatorica 27 (2007), 1\u201312.","journal-title":"Combinatorica"},{"key":"4822_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jctb.2005.01.001","volume":"94","author":"L Addario-Berry","year":"2005","unstructured":"L. Addario-Berry, R. E. L. Aldred, K. Dalal and B. A. Reed: Vertex colouring edge partitions, J. Combin. Theory Ser. B 94 (2005), 237\u2013244.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4822_CR3","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1016\/j.dam.2007.05.059","volume":"156","author":"L Addario-Berry","year":"2008","unstructured":"L. Addario-Berry, K. Dalal and B. A. Reed: Degree Constrained Subgraphs, Discrete Appl. Math. 156 (2008), 1168\u20131174.","journal-title":"Discrete Appl. Math."},{"key":"4822_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"M. Aigner and E. Triesch: Irregular assignments of trees and forests, SIAM J. Discrete Math. 3 (1990), 439\u2013449.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N Alon","year":"2000","unstructured":"N. Alon and J. H. Spencer: The Probabilistic Method, 2nd edition, Wiley, New York, 2000.","edition":"2nd edition"},{"key":"4822_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0012-365X(93)90351-S","volume":"114","author":"D Amar","year":"1993","unstructured":"D. Amar: Irregularity strength of regular graphs of large degree, Discrete Math. 114 (1993), 9\u201317.","journal-title":"Discrete Math."},{"key":"4822_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1137\/S0895480102414107","volume":"21","author":"P N Balister","year":"2007","unstructured":"P. N. Balister, E. Gy\u0150ri, J. Lehel and R. H. Schelp: Adjacent vertex distinguishing edge-colorings, SIAM J. Discrete Math. 21 (2007), 237\u2013250.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1002\/jgt.20354","volume":"60","author":"T Bartnicki","year":"2009","unstructured":"T. Bartnicki, J. Grytczuk and S. Niwczyk: Weight Choosability of Graphs, J. Graph Theory 60 (2009), 242\u2013256.","journal-title":"J. Graph Theory"},{"key":"4822_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ejc.2015.02.031","volume":"49","author":"O Baudon","year":"2015","unstructured":"O. Baudon, J. Bensmail, J. Przyby\u0142o and M. Wo\u017aniak: On decomposing regular graphs into locally irregular subgraphs, European J. Combin. 49 (2015), 90\u2013104.","journal-title":"European J. Combin."},{"key":"4822_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.dam.2018.10.008","volume":"257","author":"J Bensmail","year":"2019","unstructured":"J. Bensmail: A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs, Discrete Appl. Math. 257 (2019), 31\u201339.","journal-title":"Discrete Appl. Math."},{"key":"4822_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ejc.2016.09.011","volume":"60","author":"J Bensmail","year":"2017","unstructured":"J. Bensmail, M. Merker and C. Thomassen: Decomposing graphs into a constant number of locally irregular subgraphs, European J. Combin. 60 (2017), 124\u2013134.","journal-title":"European J. Combin."},{"key":"4822_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/jgt.10158","volume":"45","author":"T Bohman","year":"2004","unstructured":"T. Bohman and D. Kravitz: On the irregularity strength of trees, J. Graph Theory 45 (2004), 241\u2013254.","journal-title":"J. Graph Theory"},{"key":"4822_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1080\/07468342.1988.11973088","volume":"19","author":"G Chartrand","year":"1988","unstructured":"G. Chartrand, P. Erd\u0151s and O. R. Oellermann: How to Define an Irregular Graph, College Math. J. 19 (1988), 36\u201342.","journal-title":"College Math. J."},{"key":"4822_CR14","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz and F. Saba: Irregular networks, Congr. Numer. 64 (1988), 197\u2013210.","journal-title":"Congr. Numer."},{"key":"4822_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/jgt.20313","volume":"58","author":"B Cuckler","year":"2008","unstructured":"B. Cuckler and F. Lazebnik: Irregularity Strength of Dense Graphs, J. Graph Theory 58 (2008), 299\u2013313.","journal-title":"J. Graph Theory"},{"key":"4822_CR16","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/jgt.3190160409","volume":"16","author":"J H Dinitz","year":"1992","unstructured":"J. H. Dinitz, D. K. Garnick and A. Gy\u00e1rf\u00e1s: On the irregularity strength of the m \u00d7 n grid, J. Graph Theory 16 (1992), 355\u2013374.","journal-title":"J. Graph Theory"},{"key":"4822_CR17","first-page":"45","volume":"13","author":"A Dudek","year":"2011","unstructured":"A. Dudek and D. Wajc: On the complexity of vertex-coloring edge-weightings, Discrete Math. Theor. Comput. Sci. 13 (2011), 45\u201350.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"4822_CR18","first-page":"39","volume":"71","author":"G Ebert","year":"1990","unstructured":"G. Ebert, J. Hemmeter, F. Lazebnik and A. J. Woldar: On the irregularity strength of some graphs, Congr. Numer. 71 (1990), 39\u201352.","journal-title":"Congr. Numer."},{"key":"4822_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0012-365X(89)90321-X","volume":"76","author":"R J Faudree","year":"1989","unstructured":"R. J. Faudree, M. S. Jacobson, J. Lehel and R. Schelp: Irregular networks, regular graphs and integer matrices with distinct row and column sums, Discrete Math. 76 (1989), 223\u2013240.","journal-title":"Discrete Math."},{"key":"4822_CR20","series-title":"Combinatorics","first-page":"247","volume-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","author":"R J Faudree","year":"1987","unstructured":"R. J. Faudree and J. Lehel: Bound on the irregularity strength of regular graphs, Colloq. Math. Soc. J\u00e1nos Bolyai, 52, Combinatorics, Eger North Holland, Amsterdam, (1987), 247\u2013256."},{"key":"4822_CR21","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2010.02.003","volume":"158","author":"M Ferrara","year":"2010","unstructured":"M. Ferrara, R. J. Gould, M. Karo\u0144ski and F. Pfender: An iterative approach to graph irregularity strength, Discr. Appl. Math. 158 (2010), 1189\u20131194.","journal-title":"Discr. Appl. Math."},{"key":"4822_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/jgt.10056","volume":"41","author":"A Frieze","year":"2002","unstructured":"A. Frieze, R. J. Gould, M. Karo\u0144ski and F. Pfender: On Graph Irregularity Strength, J. Graph Theory 41 (2002), 120\u2013137.","journal-title":"J. Graph Theory"},{"key":"4822_CR23","unstructured":"J. A. Gallian: Graph Labeling, Electron. J. Combin. (2019), 1\u2013535, Dynamic survey DS6."},{"key":"4822_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0012-365X(88)90106-9","volume":"71","author":"A Gy\u00e1rf\u00e1s","year":"1998","unstructured":"A. Gy\u00e1rf\u00e1s: The irregularity strength of Km,m is 4 for odd m, Discrete Math. 71 (1998), 273\u2013274.","journal-title":"Discrete Math."},{"key":"4822_CR25","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","volume":"95","author":"H Hatami","year":"2005","unstructured":"H. Hatami: \u0394+300 is a bound on the adjacent vertex distinguishing edge chromatic number, J. Combin. Theory Ser. B 95 (2005), 246\u2013256.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4822_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"S. Janson, T. \u0141uczak and A. Ruci\u0144ski: Random Graphs, Wiley, New York, 2000."},{"key":"4822_CR27","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1137\/18M1200427","volume":"34","author":"G Joret","year":"2020","unstructured":"G. Joret and W. Lochet: Progress on the adjacent vertex distinguishing edge colouring conjecture, SIAM J. Discrete Math. 34 (2020), 2221\u20132238.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR28","unstructured":"M. Kalkowski: A note on 1,2-Conjecture, in Ph.D. Thesis, Pozna\u0143, 2009."},{"key":"4822_CR29","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"M. Kalkowski, M. Karo\u0144ski and F. Pfender: A new upper bound for the irregularity strength of graphs, SIAM J. Discrete Math. 25 (2011), 1319\u20131321.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR30","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","volume":"100","author":"M Kalkowski","year":"2010","unstructured":"M. Kalkowski, M. Karo\u0144ski and F. Pfender: Vertex-coloring edge-weightings: Towards the 1-2-3 conjecture, J. Combin. Theory Ser. B 100 (2010), 347\u2013349.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4822_CR31","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","volume":"91","author":"M Karo\u0144ski","year":"2004","unstructured":"M. Karo\u0144ski, T. \u0141uczak and A. Thomason: Edge weights and vertex colours, J. Combin. Theory Ser. B 91 (2004), 151\u2013157.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4822_CR32","series-title":"Graph Theory, Combinatorics and Applications","first-page":"765","volume-title":"Facts and quests on degree irregular assignments","author":"J Lehel","year":"1991","unstructured":"J. Lehel: Facts and quests on degree irregular assignments, Graph Theory, Combinatorics and Applications, Willey, New York, 1991, 765\u2013782."},{"key":"4822_CR33","doi-asserted-by":"publisher","first-page":"#P2.11","DOI":"10.37236\/6878","volume":"28","author":"K S Lyngsie","year":"2021","unstructured":"K. S. Lyngsie and L. Zhong: Vertex colouring edge weightings: A logarithmic upper bound on weight-choosability, Electron. J. Combin. 28 (2021), #P2.11.","journal-title":"Electron. J. Combin."},{"key":"4822_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/120886650","volume":"28","author":"P Majerski","year":"2014","unstructured":"P. Majerski and J. Przyby\u0142o: On the irregularity strength of dense graphs, SIAM J. Discrete Math. 28 (2014), 197\u2013205.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR35","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0895480196314291","volume":"13","author":"T Nierhoff","year":"2000","unstructured":"T. Nierhoff: A tight bound on the irregularity strength of graphs, SIAM J. Discrete Math. 13 (2000), 313\u2013323.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR36","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.22772","volume":"100","author":"J Przyby\u0142o","year":"2022","unstructured":"J. Przyby\u0142o: Asymptotic confirmation of the Faudree-Lehel Conjecture on irregularity strength for all but extreme degrees, J. Graph Theory 100 (2022), 189\u2013204.","journal-title":"J. Graph Theory"},{"key":"4822_CR37","doi-asserted-by":"publisher","first-page":"#R82","DOI":"10.37236\/806","volume":"15","author":"J Przyby\u0142o","year":"2008","unstructured":"J. Przyby\u0142o: Irregularity strength of regular graphs, Electron. J. Combin. 15 (2008), #R82.","journal-title":"Electron. J. Combin."},{"key":"4822_CR38","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/070707385","volume":"23","author":"J Przyby\u0142o","year":"2009","unstructured":"J. Przyby\u0142o: Linear bound on the irregularity strength and the total vertex irregularity strength of graphs, SIAM J. Discrete Math. 23 (2009), 511\u2013516.","journal-title":"SIAM J. Discrete Math."},{"key":"4822_CR39","doi-asserted-by":"publisher","first-page":"#P2.31","DOI":"10.37236\/5173","volume":"23","author":"J Przyby\u0141o","year":"2016","unstructured":"J. Przyby\u0141o: On decomposing graphs of large minimum degree into locally irregular subgraphs, Electron. J. Combin. 23 (2016), #P2.31","journal-title":"Electron. J. Combin."},{"key":"4822_CR40","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jctb.2020.03.005","volume":"147","author":"J Przyby\u0142o","year":"2021","unstructured":"J. Przyby\u0142o: The 1-2-3 Conjecture almost holds for regular graphs, J. Combin. Theory Ser. B 147 (2021), 183\u2013200.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4822_CR41","first-page":"101","volume":"12","author":"J Przyby\u0142o","year":"2010","unstructured":"J. Przyby\u0142o and M. Wo\u017aniak: On a 1,2 Conjecture, Discrete Math. Theor. Comput. Sci. 12 (2010), 101\u2013108.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"4822_CR42","doi-asserted-by":"publisher","first-page":"#P112","DOI":"10.37236\/599","volume":"18","author":"J Przyby\u0142o","year":"2011","unstructured":"J. Przyby\u0142o and M. Wo\u017aniak: Total weight choosability of graphs, Electron. J. Combin. 18 (2011), #P112.","journal-title":"Electron. J. Combin."},{"key":"4822_CR43","unstructured":"B. Seamone: The 1-2-3 Conjecture and related problems: a survey, Technical report, available online at http:\/\/arxiv.org\/abs\/1211.5122, 2012."},{"key":"4822_CR44","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jctb.2016.06.010","volume":"121","author":"C Thomassen","year":"2016","unstructured":"C. Thomassen, Y. Wu and C. Q. Zhang: The 3-flow conjecture, factors modulo k, and the 1-2-3 conjecture, J. Combin. Theory Ser. B 121 (2016), 308\u2013325.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4822_CR45","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.disc.2017.12.001","volume":"341","author":"B Vu\u010dkovi\u0107","year":"2018","unstructured":"B. Vu\u010dkovi\u0107: Multi-set neighbor distinguishing 3-edge coloring, Discrete Math. 341 (2018), 820\u2013824.","journal-title":"Discrete Math."},{"key":"4822_CR46","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s11464-008-0041-x","volume":"3","author":"T Wang","year":"2008","unstructured":"T. Wang and Q. Yu: On vertex-coloring 13-edge-weighting, Front. Math. China 3 (2008), 581\u2013587.","journal-title":"Front. Math. China"},{"key":"4822_CR47","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00493-014-3057-8","volume":"36","author":"T Wong","year":"2016","unstructured":"T. Wong and X. Zhu: Every graph is (2,3)-choosable, Combinatorica 36 (2016), 121\u2013127.","journal-title":"Combinatorica"},{"key":"4822_CR48","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1002\/jgt.20500","volume":"66","author":"T Wong","year":"2011","unstructured":"T. Wong and X. Zhu: Total weight choosability of graphs, J. Graph Theory 66 (2011), 198\u2013212.","journal-title":"J. Graph Theory"},{"key":"4822_CR49","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Z. Zhang, L. Liu and J. Wang: Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15 (2002), 623\u2013626.","journal-title":"Appl. Math. Lett."},{"key":"4822_CR50","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1002\/jgt.22413","volume":"90","author":"L Zhong","year":"2019","unstructured":"L. Zhong: The 1-2-3-conjecture holds for dense graphs, J. Graph Theory 90 (2019), 561\u2013564.","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4822-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4822-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4822-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T17:09:29Z","timestamp":1675530569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4822-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":50,"journal-issue":{"issue":"S2","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4822"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4822-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,21]]},"assertion":[{"value":"15 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}