{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:17:56Z","timestamp":1762273076627},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T00:00:00Z","timestamp":1683676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T00:00:00Z","timestamp":1683676800000},"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":[[2023,8]]},"DOI":"10.1007\/s00493-023-00036-5","type":"journal-article","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:19:03Z","timestamp":1683789543000},"page":"791-826","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Asymptotic Confirmation of the Faudree\u2013Lehel Conjecture for General Graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"Jakub","family":"Przyby\u0142o","sequence":"first","affiliation":[]},{"given":"Fan","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,10]]},"reference":[{"key":"36_CR1","unstructured":"Chartrand, G., Jacobson, M. S., Lehel, J., Oellermann, O. R. Ruiz, S., Saba, F.: Irregular networks, vol. 64, pp. 197\u2013210 (1988). 250th Anniversary Conference on Graph Theory, Fort Wayne (1986)"},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/jgt.3190110214","volume":"11","author":"Y Alavi","year":"1987","unstructured":"Alavi, Y., Chartrand, G., Chung, F.R.K., Erd\u0151s, P., Graham, R.L., Oellermann, O.R.: Highly irregular graph. J. Graph Theory 11(2), 235\u2013249 (1987)","journal-title":"J. Graph Theory"},{"key":"36_CR3","first-page":"201","volume":"65","author":"Y Alavi","year":"1988","unstructured":"Alavi, Y., Boals, Y., Chartrand, G., Erd\u0151s, P., Oellermann, O.R.: $$k$$-Path irregular graph. Congr. Numer. 65, 201\u2013210 (1988)","journal-title":"Congr. Numer."},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1080\/07468342.1988.11973088","volume":"19","author":"G Chartrand","year":"1988","unstructured":"Chartrand, G., Erd\u0151s, P., Oellermann, O.R.: How to define an irregular graph. Coll. Math. J. 19(1), 36\u201342 (1988)","journal-title":"Coll. Math. J."},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner, M., Triesch, E.: Irregular assignments of trees and forests. SIAM J. Discret. Math. 3(4), 439\u2013449 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0895480196314291","volume":"13","author":"T Nierhoff","year":"2000","unstructured":"Nierhoff, T.: A tight bound on the irregularity strength of graphs. SIAM J. Discret. Math. 13(3), 313\u2013323 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"36_CR7","first-page":"247","volume":"52","author":"RJ Faudree","year":"1988","unstructured":"Faudree, R.J., Lehel, J.: Bound on the irregularity strength of regular graphs. Combin. Colloq. Math. Soc. J\u00e1nos Bolyai 52, 247\u2013256 (1988)","journal-title":"Combin. Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"36_CR8","unstructured":"Lehel, J.: Facts and quests on degree irregular assignments. In: Graph Theory, Combinatorics, and Applications, vol. 2 (Kalamazoo, MI, 1988). Wiley, New York, pp. 765\u2013781 (1991)"},{"issue":"4","key":"36_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/jgt.20313","volume":"58","author":"B Cuckler","year":"2008","unstructured":"Cuckler, B., Lazebnik, F.: Irregularity strength of dense graphs. J. Graph Theory 58(4), 299\u2013313 (2008)","journal-title":"J. Graph Theory"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-007-0041-6","volume":"27","author":"L Addario-Berry","year":"2007","unstructured":"Addario-Berry, L., Dalal, K., McDiarmid, C., Reed, B.A., Thomason, A.: Vertex-colouring edge-weightings. Combinatorica 27(1), 1\u201312 (2007)","journal-title":"Combinatorica"},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jctb.2005.01.001","volume":"94","author":"L Addario-Berry","year":"2005","unstructured":"Addario-Berry, L., Aldred, R.E.L., Dalal, K., Reed, B.A.: Vertex colouring edge partitions. J. Combin. Theory Ser. B 94(2), 237\u2013244 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0012-365X(93)90351-S","volume":"114","author":"D Amar","year":"1993","unstructured":"Amar, D.: Irregularity strength of regular graphs of large degree. Discret. Math. 114, 9\u201317 (1993)","journal-title":"Discret. Math."},{"issue":"21","key":"36_CR13","doi-asserted-by":"publisher","first-page":"6316","DOI":"10.1016\/j.disc.2009.05.023","volume":"309","author":"M Anholcer","year":"2009","unstructured":"Anholcer, M., Kalkowski, M., Przyby\u0142o, J.: A new upper bound for the total vertex irregularity strength of graphs. Discret. Math. 309(21), 6316\u20136317 (2009)","journal-title":"Discret. Math."},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1016\/j.disc.2005.11.075","volume":"307","author":"M Ba\u010da","year":"2007","unstructured":"Ba\u010da, M., Jendro\u013e, S., Miller, M., Ryan, J.: On irregular total labellings. Discret. Math. 307, 1378\u20131388 (2007)","journal-title":"Discret. Math."},{"issue":"3","key":"36_CR15","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(3), 242\u2013256 (2009)","journal-title":"J. Graph Theory"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ejc.2016.09.011","volume":"60","author":"J Bensmail","year":"2017","unstructured":"Bensmail, J., Merker, M., Thomassen, C.: Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Combin. 60, 124\u2013134 (2017)","journal-title":"Eur. J. Combin."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/jgt.10158","volume":"45","author":"T Bohman","year":"2004","unstructured":"Bohman, T., Kravitz, D.: On the irregularity strength of trees. J. Graph Theory 45, 241\u2013254 (2004)","journal-title":"J. Graph Theory"},{"issue":"1\u20132","key":"36_CR18","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. Combin. Theory B 149(1\u20132), 109\u2013146 (2021)","journal-title":"J. Combin. Theory B"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/jgt.3190160409","volume":"16","author":"JH Dinitz","year":"1992","unstructured":"Dinitz, J.H., Garnick, D.K., Gy\u00e1rf\u00e1s, A.: On the irregularity strength of the $$m \\times n$$ grid. J. Graph Theory 16, 355\u2013374 (1992)","journal-title":"J. Graph Theory"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0012-365X(89)90321-X","volume":"76","author":"RJ Faudree","year":"1989","unstructured":"Faudree, R.J., Jacobson, M.S., Lehel, J., Schelp, R.: Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discret. Math. 76, 223\u2013240 (1989)","journal-title":"Discret. Math."},{"key":"36_CR21","first-page":"247","volume":"52","author":"RJ Faudree","year":"1987","unstructured":"Faudree, R.J., Lehel, J.: Bound on the irregularity strength of regular graphs. Combin. Colloq. Math. Soc. J\u00e1nos Bolyai 52, 247\u2013256 (1987)","journal-title":"Combin. Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2010.02.003","volume":"158","author":"M Ferrara","year":"2010","unstructured":"Ferrara, M., Gould, R.J., Karo\u0144ski, M., Pfender, F.: An iterative approach to graph irregularity strength. Discret. Appl. Math. 158, 1189\u20131194 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"36_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/jgt.10056","volume":"41","author":"A Frieze","year":"2002","unstructured":"Frieze, A., Gould, R.J., Karo\u0144ski, M., Pfender, F.: On graph irregularity strength. J. Graph Theory 41(2), 120\u2013137 (2002)","journal-title":"J. Graph Theory"},{"key":"36_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":"Gy\u00e1rf\u00e1s, A.: The irregularity strength of $$K_{m, m}$$ is $$4$$ for odd $$m$$. Discret. Math. 71, 273\u2013274 (1998)","journal-title":"Discret. Math."},{"issue":"3","key":"36_CR25","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"Kalkowski, M., Karo\u0144ski, M., Pfender, F.: A new upper bound for the irregularity strength of graphs. SIAM J. Discret. Math. 25(3), 1319\u20131321 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"Kalkowski, M., Karo\u0144ski, M., Pfender, F.: Vertex-coloring edge-weightings: towards the 1\u20132\u20133 conjecture. J. Combin. Theory B 100(3), 347\u2013349 (2010)","DOI":"10.1016\/j.jctb.2009.06.002"},{"key":"36_CR27","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 B 91, 151\u2013157 (2004)","journal-title":"J. Combin. Theory B"},{"issue":"1","key":"36_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/120886650","volume":"28","author":"P Majerski","year":"2014","unstructured":"Majerski, P., Przyby\u0142o, J.: On the irregularity strength of dense graphs. SIAM J. Discret. Math. 28(1), 197\u2013205 (2014)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"36_CR29","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/jgt.21748","volume":"76","author":"P Majerski","year":"2014","unstructured":"Majerski, P., Przyby\u0142o, J.: Total vertex irregularity strength of dense graphs. J. Graph Theory 76(1), 34\u201341 (2014)","journal-title":"J. Graph Theory"},{"issue":"1","key":"36_CR30","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.22772","volume":"100","author":"J Przyby\u0142o","year":"2022","unstructured":"Przyby\u0142o, J.: Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. J. Graph Theory 100(1), 189\u2013204 (2022)","journal-title":"J. Graph Theory"},{"key":"36_CR31","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1002\/rsa.20553","volume":"47","author":"J Przyby\u0142o","year":"2015","unstructured":"Przyby\u0142o, J.: Asymptotically optimal neighbour sum distinguishing colourings of graphs. Rand. Struct. Algoritm. 47, 776\u2013791 (2015)","journal-title":"Rand. Struct. Algoritm."},{"issue":"2","key":"36_CR32","doi-asserted-by":"publisher","first-page":"31","DOI":"10.37236\/5173","volume":"23","author":"J Przyby\u0142o","year":"2016","unstructured":"Przyby\u0142o, J.: On decomposing graphs of large minimum degree into locally irregular subgraphs. Electron. J. Combin. 23(2), 31 (2016)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"36_CR33","doi-asserted-by":"publisher","first-page":"82","DOI":"10.37236\/806","volume":"15","author":"J Przyby\u0142o","year":"2008","unstructured":"Przyby\u0142o, J.: Irregularity strength of regular graphs. Electron. J. Combin. 15(1), 82 (2008)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"36_CR34","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/070707385","volume":"23","author":"J Przyby\u0142o","year":"2008","unstructured":"Przyby\u0142o, J.: Linear bound on the irregularity strength and the total vertex irregularity strength of graphs. SIAM J. Discret. Math. 23(1), 511\u2013516 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"36_CR35","doi-asserted-by":"crossref","unstructured":"Przyby\u0142o, J.: The 1\u20132\u20133 conjecture almost holds for regular graphs. J. Combin. Theory B 147, 183\u2013200 (2021)","DOI":"10.1016\/j.jctb.2020.03.005"},{"key":"36_CR36","doi-asserted-by":"crossref","unstructured":"Thomassen, C., Wu, Y., Zhang, C.Q.: The $$3$$-flow conjecture, factors modulo $$k$$, and the 1\u20132\u20133 conjecture. J. Combin. Theory B 121, 308\u2013325 (2016)","DOI":"10.1016\/j.jctb.2016.06.010"},{"issue":"1","key":"36_CR37","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00493-014-3057-8","volume":"36","author":"T Wong","year":"2016","unstructured":"Wong, T., Zhu, X.: Every graph is (2,3)-choosable. Combinatorica 36(1), 121\u2013127 (2016)","journal-title":"Combinatorica"},{"issue":"2","key":"36_CR38","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S0963548322000220","volume":"32","author":"N Alon","year":"2023","unstructured":"Alon, N., Wei, F.: Irregular subgraphs. Combin. Probab. Comput. 32(2), 269\u2013283 (2023)","journal-title":"Combin. Probab. Comput."},{"key":"36_CR39","doi-asserted-by":"crossref","unstructured":"Kalkowski, M.: A note on 1,2 conjecture. Ph.D Thesis (2009)","DOI":"10.5771\/9783845268019-1"},{"key":"36_CR40","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/rsa.21058","volume":"61","author":"J Przyby\u0142o","year":"2022","unstructured":"Przyby\u0142o, J.: A generalisation of Faudree-Lehel conjecture holds almost surely for random graphs. Rand. Struct Algoritm. 61, 383\u2013396 (2022)","journal-title":"Rand. Struct Algoritm."},{"key":"36_CR41","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley Series in Discrete Mathematics and Optimization, 4th edn. Wiley, Hoboken (2016)"},{"issue":"2","key":"36_CR42","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D Dubhashi","year":"1998","unstructured":"Dubhashi, D., Ranjan, D.: Balls and bins: a study in negative dependence. Rand. Struct. Algorithm. 13(2), 99\u2013124 (1998)","journal-title":"Rand. Struct. Algorithm."},{"key":"36_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M Molloy","year":"2002","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Berlin (2002)"},{"key":"36_CR44","doi-asserted-by":"crossref","unstructured":"Przyby\u0142o, J., Wei, F.: Short proof on the asymptotic confirmation of the Faudree\u2013Lehel conjecture. (2022)","DOI":"10.1007\/s00493-023-00036-5"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00036-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00036-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00036-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T16:06:29Z","timestamp":1692806789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00036-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,10]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00036-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,10]]},"assertion":[{"value":"9 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}