{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T17:02:26Z","timestamp":1784739746717,"version":"3.55.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901243"],"award-info":[{"award-number":["11901243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201569"],"award-info":[{"award-number":["12201569"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10878-026-01390-y","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:02:57Z","timestamp":1782795777000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong edge chromatic index of subquartic graphs"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1561-5772","authenticated-orcid":false,"given":"Junlei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuehua","family":"Bu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,30]]},"reference":[{"issue":"1\u20133","key":"1390_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"LD Andersen","year":"1992","unstructured":"Andersen LD (1992) The strong chromatic index of a cubic graph is at most 10. Discrete Math 108(1\u20133):231\u2013252","journal-title":"Discrete Math"},{"key":"1390_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.endm.2015.06.104","volume":"49","author":"J Bensmail","year":"2015","unstructured":"Bensmail J, Bonamy M, Hocquard H (2015) Strong edge coloring sparse graphs. Electron Note Discrete Math 49:773\u2013778","journal-title":"Electron Note Discrete Math"},{"key":"1390_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.jctb.2022.01.009","volume":"155","author":"M Bonamy","year":"2022","unstructured":"Bonamy M, Perrett T, Postle L (2022) Colouring graphs with sparse neighbourhoods: Bounds and applications.J. Combin. Theory Ser. B 155:278\u2013317","journal-title":"Combin. Theory Ser. B"},{"issue":"1","key":"1390_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0963548317000244","volume":"27","author":"H Bruhn","year":"2018","unstructured":"Bruhn H, Joos F (2018) A strong bound for the strong chromatic index. Combin Probab Comput 27(1):21\u201343","journal-title":"Combin Probab Comput"},{"key":"1390_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejc.2017.06.001","volume":"67","author":"I Choi","year":"2018","unstructured":"Choi I, Kim J, Kostochka AV, Raspaud A (2018) Strong edge-colorings of sparse graphs with large maximum degree. European J Combin 67:21\u201339","journal-title":"European J Combin"},{"key":"1390_CR6","doi-asserted-by":"publisher","first-page":"2772","DOI":"10.1016\/j.disc.2006.03.053","volume":"306","author":"DW Cranston","year":"2006","unstructured":"Cranston DW (2006) A strong bound edge-colouring of graphs with maximum degree 4 using 22 colours. Discrete Math 306:2772\u20132778","journal-title":"Discrete Math"},{"key":"1390_CR7","first-page":"161","volume-title":"Irregularities of partitions","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s P, Ne\u0161et\u0159il J, Hal\u00e1sz G (1989) Irregularities of partitions. Springer, Berlin, pp 161\u2013349"},{"key":"1390_CR8","first-page":"141","volume":"16","author":"JL Fouquet","year":"1983","unstructured":"Fouquet JL, Jolivet JL (1983) Strong edge-colorings of graphs and applications to multi-k-gons. Ars Combin 16:141\u2013150","journal-title":"Ars Combin"},{"issue":"16\u201317","key":"1390_CR9","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1016\/j.dam.2013.05.021","volume":"161","author":"H Hocquard","year":"2013","unstructured":"Hocquard H, Montassier M, Raspaud A, Valicov P (2013) On strong edge-colouring of subcubic graphs. Discrete Appl Math 161(16\u201317):2467\u20132479","journal-title":"Discrete Appl Math"},{"issue":"2","key":"1390_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/jgt.3190170204","volume":"17","author":"P Hor\u00e1k","year":"1993","unstructured":"Hor\u00e1k P, Qing H, Trotter WT (1993) Induced matching in cubic graphs. J Graph Theory 17(2):151\u2013160","journal-title":"J Graph Theory"},{"key":"1390_CR11","doi-asserted-by":"crossref","unstructured":"Huang MF, Santana M, Yu GX (2018) Strong chromatic index of graphs with maximum degree four, Electron. J. Combin., 25(3): Paper 3. 31, 24pp","DOI":"10.37236\/7016"},{"key":"1390_CR12","doi-asserted-by":"crossref","unstructured":"Hurley E, de Joannis de Verclos R, Kang RJ (2020) An improved procedure for colouring graphs of bounded local density, arXiv:2007.07874 [math.CO]","DOI":"10.1137\/1.9781611976465.10"},{"key":"1390_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106313","volume":"179","author":"XW Li","year":"2023","unstructured":"Li XW, Li YF, Lv JB, Wang T (2023) Strong edge-colorings of sparse graphs with $$3\\Delta -1$$ colors. Inform Process Lett 179:106313","journal-title":"Inform Process Lett"},{"key":"1390_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2023.11.023","volume":"344","author":"J Lu","year":"2024","unstructured":"Lu J, Liu HQ, Hu XL (2024) On strong edge-coloring of graphs with maximum degree 5. Discrete Appl Math 344:120\u2013128","journal-title":"Discrete Appl Math"},{"key":"1390_CR15","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.dam.2017.09.006","volume":"235","author":"JB Lv","year":"2018","unstructured":"Lv JB, Li XW, Yu GX (2018) On strong edge-coloring of graphs with maximum degree 4. Discrete Appl Math 235:142\u2013153","journal-title":"Discrete Appl Math"},{"issue":"3","key":"1390_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","volume":"118","author":"M Mahdian","year":"2002","unstructured":"Mahdian M (2002) On the computational complexity of strong edge-coloring. Discrete Appl Math 118(3):239\u2013248","journal-title":"Discrete Appl Math"},{"issue":"2","key":"1390_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M Molloy","year":"1997","unstructured":"Molloy M, Reed B (1997) A bound on the strong chromatic index of a graph. J Combin Theory Ser B 69(2):103\u2013109","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"1390_CR18","first-page":"41","volume":"51","author":"LZ Qin","year":"2022","unstructured":"Qin LZ, Lv JB, Li JX (2022) Strong edge-coloring of some sparse graphs. Adv Math (China) 51(1):41\u201352","journal-title":"Adv Math (China)"},{"key":"1390_CR19","first-page":"106","volume":"68","author":"W Ruksasakchai","year":"2017","unstructured":"Ruksasakchai W, Wang T (2017) List strong edge coloring of some classes of graphs. Australas J Combin 68:106\u2013117","journal-title":"Australas J Combin"},{"key":"1390_CR20","unstructured":"Zang CY (2015) The strong chromatic index of graphs with maximum degree $$\\Delta $$, arXiv:1510.00785vl"},{"key":"1390_CR21","doi-asserted-by":"crossref","unstructured":"Zhu JL, Zhu HG (2023) Strong edge coloring of subquartic graphs, in W. Wu and J. Guo (Eds.): COCOA, LNCS 14462, 139-146, 2024","DOI":"10.1007\/978-3-031-49614-1_9"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01390-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01390-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01390-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:17:22Z","timestamp":1784737042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01390-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,30]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1390"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01390-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,30]]},"assertion":[{"value":"7 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"We declare that we have no conflicts of interest to this work. We also declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":1,"name":"Ethics","label":"Conflicts of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"60"}}