{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:02:17Z","timestamp":1748923337228,"version":"3.41.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T00:00:00Z","timestamp":1744934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T00:00:00Z","timestamp":1744934400000},"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":[[2025,6]]},"DOI":"10.1007\/s00373-025-02927-4","type":"journal-article","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T20:32:41Z","timestamp":1745008361000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Irregularity Notions for Digraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Filasto","sequence":"additional","affiliation":[]},{"given":"Herv\u00e9","family":"Hocquard","sequence":"additional","affiliation":[]},{"given":"Clara","family":"Marcille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,18]]},"reference":[{"issue":"2","key":"2927_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.dam.2016.08.013","volume":"217","author":"E Barme","year":"2017","unstructured":"Barme, E., Bensmail, J., Przyby\u0142o, J., Wo\u017aniak, M.: On a directed variation of the 1-2-3 and 1\u20132 Conjectures. Discrete Appl. Math. 217(2), 123\u2013131 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"2927_CR2","doi-asserted-by":"publisher","first-page":"795","DOI":"10.7494\/OpMath.2018.38.6.795","volume":"38","author":"O Baudon","year":"2018","unstructured":"Baudon, O., Bensmail, J., Hocquard, H., Senhaji, M., Sopena, \u00c9.: On locally irregular decompositions of subcubic graphs. Opusc. Math. 38(6), 795\u2013817 (2018)","journal-title":"Opusc. Math."},{"key":"2927_CR3","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. Combin. 49, 90\u2013104 (2015)","journal-title":"Eur. J. Combin."},{"doi-asserted-by":"crossref","unstructured":"Baudon, O., Bensmail, J., Przyby\u0142o, J., Wo\u017aniak, M.: On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discrete Math. Theor. Comput. Sci. 20(2), #7 (2018)","key":"2927_CR4","DOI":"10.23638\/DMTCS-20-2-7"},{"issue":"1","key":"2927_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.7151\/dmgt.1791","volume":"35","author":"O Baudon","year":"2015","unstructured":"Baudon, O., Bensmail, J., Sopena, \u00c9.: An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory 35(1), 141\u2013156 (2015)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2927_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jda.2014.12.008","volume":"30","author":"O Baudon","year":"2015","unstructured":"Baudon, O., Bensmail, J., Sopena, \u00c9.: On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms 30, 113\u2013127 (2015)","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Bensmail, J., Szabo Lyngsie, K.: 1-2-3 Conjecture in digraphs. More results and directions. Discrete Appl. Math. 284, 124\u2013137 (2020)","key":"2927_CR7","DOI":"10.1016\/j.dam.2020.03.017"},{"issue":"5","key":"2927_CR8","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s00373-016-1705-z","volume":"32","author":"J Bensmail","year":"2016","unstructured":"Bensmail, J., Renault, G.: Decomposing oriented graphs into six locally irregular oriented graphs. Graphs Combin. 32(5), 1707\u20131721 (2016)","journal-title":"Graphs Combin."},{"key":"2927_CR9","doi-asserted-by":"publisher","first-page":"1869","DOI":"10.1007\/s00373-020-02193-6","volume":"36","author":"J Bensmail","year":"2020","unstructured":"Bensmail, J., Dross, F., Nisse, N.: Decomposing degenerate graphs into locally irregular subgraphs. Graphs Combin. 36, 1869\u20131889 (2020)","journal-title":"Graphs Combin."},{"key":"2927_CR10","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":"2927_CR11","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand, G., Jacobson, M.S., Lehel, J., Oellermann, O.R., Ruiz, S., Saba, F.: Irregular networks. Congress. Numer. 64, 197\u2013210 (1988)","journal-title":"Congress. Numer."},{"key":"2927_CR12","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.dam.2017.11.016","volume":"236","author":"M Hor\u0148\u00e1k","year":"2018","unstructured":"Hor\u0148\u00e1k, M., Przyby\u0142o, J., Wo\u017aniak, M.: A note on a directed version of the 1-2-3 Conjecture. Discrete Appl. Math. 236, 472\u2013476 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2927_CR13","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":"2927_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.entcs.2019.08.053","volume":"346","author":"CN Lintzmayer","year":"2019","unstructured":"Lintzmayer, C.N., Mota, G.O., Sambinelli, M.: Decomposing split graphs into locally irregular graphs. Electron. Notes Theor. Comput. Sci. 346, 603\u2013612 (2019)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"unstructured":"Lov\u00e1sz, L.: Coverings and coloring of hypergraphs. In: Proceedings 4th South-eastern Conference on Combinatorics, Graph Theory, and Computing, pp. 3\u201312 (1973)","key":"2927_CR15"},{"issue":"2","key":"2927_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10878-017-0178-1","volume":"35","author":"B Lu\u017ear","year":"2018","unstructured":"Lu\u017ear, B., Petru\u0161evski, M., \u0160krekovski, R.: On vertex-parity edge-colorings. J. Combin. Optim. 35(2), 373\u2013388 (2018)","journal-title":"J. Combin. Optim."},{"issue":"4","key":"2927_CR17","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1007\/s10878-018-0313-7","volume":"36","author":"B Lu\u017ear","year":"2018","unstructured":"Lu\u017ear, B., Przyby\u0142o, J., Sot\u00e1k, R.: New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Combin. Optim. 36(4), 1425\u20131438 (2018)","journal-title":"J. Combin. Optim."},{"issue":"4","key":"2927_CR18","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Przyby\u0142o, J.: On decomposing graphs of large minimum degree into locally irregular subgraphs. Electron. J. Combin. 23(2), #P2.31 (2016)","key":"2927_CR19","DOI":"10.37236\/5173"},{"doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","key":"2927_CR20","DOI":"10.1145\/800133.804350"},{"issue":"24","key":"2927_CR21","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.3390\/math9243209","volume":"9","author":"J Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Remarks on the local irregularity conjecture. Mathematics 9(24), 3209 (2021)","journal-title":"Mathematics"},{"key":"2927_CR22","first-page":"1","volume":"11","author":"J Sedlar","year":"2023","unstructured":"Sedlar, J., \u0160krekovski, R.: A note on the locally irregular edge colorings of cacti. Discrete Math. Lett. 11, 1\u20136 (2023)","journal-title":"Discrete Math. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02927-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02927-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02927-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:15:32Z","timestamp":1748855732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02927-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,18]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2927"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02927-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,4,18]]},"assertion":[{"value":"19 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2025","order":3,"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"}}],"article-number":"60"}}