{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T20:13:09Z","timestamp":1783714389637,"version":"3.55.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007751","name":"AGH University of Krakow","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.disc.2026.115319","type":"journal-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T19:56:57Z","timestamp":1783627017000},"page":"115319","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Locally irregular total colorings of graphs"],"prefix":"10.1016","volume":"349","author":[{"given":"Anna","family":"Flaszczy\u0144ska","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleksandra","family":"Gorzkowska","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1011-535X","authenticated-orcid":false,"given":"Igor","family":"Grzelec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfr\u00e9d","family":"Onderko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariusz","family":"Wo\u017aniak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.disc.2026.115319_br0010","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1016\/j.dam.2007.05.059","article-title":"Degree constrained subgraphs","volume":"156","author":"Addario-Berry","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115319_br0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00493-007-0041-6","article-title":"Vertex-colouring edge weightings","volume":"27","author":"Addario-Berry","year":"2007","journal-title":"Combinatorica"},{"key":"10.1016\/j.disc.2026.115319_br0030","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0167-5060(08)70561-2","article-title":"The star arboricity of graphs","volume":"43","author":"Algor","year":"1989","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.disc.2026.115319_br0040","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejc.2015.02.031","article-title":"On decomposing regular graphs into locally irregular subgraphs","volume":"49","author":"Baudon","year":"2015","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115319_br0050","doi-asserted-by":"crossref","first-page":"1869","DOI":"10.1007\/s00373-020-02193-6","article-title":"Decomposing degenerate graphs into locally irregular subgraphs","volume":"36","author":"Bensmail","year":"2020","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115319_br0060","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ejc.2016.09.011","article-title":"Decomposing graphs into a constant number of locally irregular subgraphs","volume":"60","author":"Bensmail","year":"2017","journal-title":"Eur. J. Comb."},{"issue":"3","key":"10.1016\/j.disc.2026.115319_br0070","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","article-title":"On acyclic colorings of planar graphs","volume":"25","author":"Borodin","year":"1979","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.disc.2026.115319_br0080","first-page":"21","article-title":"Every 4-valent graph has an acyclic 5-coloring","volume":"93","author":"Burstein","year":"1979","journal-title":"Soobshch. Akad. Nauk Gruzin. SSR"},{"key":"10.1016\/j.disc.2026.115319_br0090","author":"Deng"},{"key":"10.1016\/j.disc.2026.115319_br0100","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.jctb.2025.05.002","article-title":"The 1-2 conjecture holds for regular graphs","volume":"174","author":"Deng","year":"2025","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"10.1016\/j.disc.2026.115319_br0110","first-page":"45","article-title":"On the complexity of vertex-coloring edge-weightings","volume":"13","author":"Dudek","year":"2011","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.disc.2026.115319_br0120","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(94)00313-8","article-title":"Star arboricity of graphs","volume":"149","author":"Hakimi","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115319_br0130","series-title":"Algorithmic Methods for the Irregularity Strength of Graphs","author":"Kalkowski","year":"2009"},{"issue":"3","key":"10.1016\/j.disc.2026.115319_br0140","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","article-title":"Vertex-coloring edge-weightings: towards the 1-2-3-conjecture","volume":"100","author":"Kalkowski","year":"2010","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"10.1016\/j.disc.2026.115319_br0150","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","article-title":"Edge weights and vertex colours","volume":"91","author":"Karo\u0144ski","year":"2004","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115319_br0160","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.jctb.2024.01.002","article-title":"A solution to the 1-2-3 conjecture","volume":"166","author":"Keusch","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115319_br0170","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/s00493-023-00027-6","article-title":"Vertex-coloring graphs with 4-edge-weightings","volume":"43","author":"Keusch","year":"2023","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.disc.2026.115319_br0180","doi-asserted-by":"crossref","first-page":"153","DOI":"10.26493\/1855-3974.198.541","article-title":"Graphs with maximum degree 5 are acyclically 7-colorable","volume":"4","author":"Kostochka","year":"2011","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.disc.2026.115319_br0190","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.dam.2020.12.002","article-title":"Decomposing split graphs into locally irregular graphs","volume":"292","author":"Lintzmayer","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.disc.2026.115319_br0200","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1007\/s10878-018-0313-7","article-title":"New bounds for locally irregular chromatic index of bipartite and subcubic graphs","volume":"36","author":"Lu\u017ear","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.disc.2026.115319_br0210","doi-asserted-by":"crossref","first-page":"N35","DOI":"10.37236\/910","article-title":"A note on neighbour-distinguishing regular graphs total-weighting","volume":"15","author":"Przyby\u0142o","year":"2008","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115319_br0220","first-page":"2","article-title":"On decomposing graphs of large minimum degree into locally irregular subgraphs","volume":"23","author":"Przyby\u0142o","year":"2016","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115319_br0230","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.jctb.2020.03.005","article-title":"The 1-2-3 conjecture almost holds for regular graphs","volume":"147","author":"Przyby\u0142o","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"10.1016\/j.disc.2026.115319_br0240","first-page":"101","article-title":"On a 1, 2 conjecture","volume":"12","author":"Przyby\u0142o","year":"2010","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.disc.2026.115319_br0250","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.dam.2023.10.005","article-title":"Local irregularity conjecture vs. cacti","volume":"343","author":"Sedlar","year":"2024","journal-title":"Discrete Appl. Math."},{"issue":"24","key":"10.1016\/j.disc.2026.115319_br0260","doi-asserted-by":"crossref","first-page":"3209","DOI":"10.3390\/math9243209","article-title":"Remarks on the local irregularity conjecture","volume":"9","author":"Sedlar","year":"2021","journal-title":"Mathematics"},{"key":"10.1016\/j.disc.2026.115319_br0270","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.jctb.2016.06.010","article-title":"The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture","volume":"121","author":"Thomassen","year":"2016","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115319_br0280","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s11464-008-0041-x","article-title":"A note on vertex-coloring 13-edge-weighting","volume":"3","author":"Wang","year":"2008","journal-title":"Front. Math. China"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T19:21:54Z","timestamp":1783711314000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26003432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":28,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0012365X26003432"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115319","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Locally irregular total colorings of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115319","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115319"}}