{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T05:22:53Z","timestamp":1783660973424,"version":"3.55.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T00:00:00Z","timestamp":1528416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-018-0313-7","type":"journal-article","created":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T00:45:42Z","timestamp":1528418742000},"page":"1425-1438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["New bounds for locally irregular chromatic index of bipartite and subcubic graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8356-8827","authenticated-orcid":false,"given":"Borut","family":"Lu\u017ear","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Przyby\u0142o","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Sot\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"issue":"2","key":"313_CR1","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 REL, Dalal K, Reed BA (2005) Vertex colouring edge partitions. J Combin Theory Ser B 94(2):237\u2013244","journal-title":"J Combin Theory Ser B"},{"key":"313_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 (2015) On decomposing regular graphs into locally irregular subgraphs. Eur J Combin 49:90\u2013104","journal-title":"Eur J Combin"},{"key":"313_CR3","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 (2015) On the complexity of determining the irregular chromatic index of a graph. J Discret Algorithms 30:113\u2013127","journal-title":"J Discret Algorithms"},{"key":"313_CR4","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 (2017) Decomposing graphs into a constant number of locally irregular subgraphs. Eur J Combin 60:124\u2013134","journal-title":"Eur J Combin"},{"issue":"3","key":"313_CR5","first-page":"333","volume":"16","author":"F Havet","year":"2014","unstructured":"Havet F, Paramaguru N, Sampathkumar R (2014) Detection number of bipartite graphs and cubic graphs. Discret Math Theor Comput Sci 16(3):333\u2013342","journal-title":"Discret Math Theor Comput Sci"},{"issue":"3","key":"313_CR6","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 (2010) Vertex-coloring edge-weightings: towards the 1-2-3-conjecture. J Combin Theory Ser B 100(3):347\u2013349","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"313_CR7","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 (2004) Edge weights and vertex colours. J Combin Theor Ser B 91(1):151\u2013157","journal-title":"J Combin Theor Ser B"},{"key":"313_CR8","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 (2018) On vertex-parity edge-colorings. J Combin Optim 35:373\u2013388","journal-title":"J Combin Optim"},{"key":"313_CR9","first-page":"2","volume":"23","author":"J Przyby\u0142o","year":"2016","unstructured":"Przyby\u0142o J (2016) On decomposing graphs of large minimum degree into locally irregular subgraphs. Electron J Combin 23:2\u201331","journal-title":"Electron J Combin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0313-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0313-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0313-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T19:21:18Z","timestamp":1559935278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0313-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["313"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0313-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,8]]},"assertion":[{"value":"8 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}