{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:59:10Z","timestamp":1781074750034,"version":"3.54.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10878-022-00972-w","type":"journal-article","created":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T07:07:50Z","timestamp":1673075270000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Injective edge coloring of sparse graphs with maximum degree 5"],"prefix":"10.1007","volume":"45","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":"Yuehua","family":"Bu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,7]]},"reference":[{"key":"972_CR1","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.disc.2018.10.018","volume":"342","author":"M Axenovich","year":"2019","unstructured":"Axenovich M, D\u00f6rr P, Rollin J, Ueckerdt T (2019) Induced and weak induced arboricities. Discrete Math 342:511\u2013519","journal-title":"Discrete Math"},{"issue":"2","key":"972_CR2","doi-asserted-by":"publisher","first-page":"1850022","DOI":"10.1142\/S1793830918500222","volume":"10","author":"YH Bu","year":"2018","unstructured":"Bu YH, Qi CT (2018) Injective edge coloring of sparse graphs. Discrete Math Algorithms Appl 10(2):1850022","journal-title":"Discrete Math Algorithms Appl"},{"issue":"6","key":"972_CR3","first-page":"675","volume":"49","author":"YH Bu","year":"2020","unstructured":"Bu YH, Qi CT, Zhu JL (2020) Injective edge coloring of planar graphs. Adv Math (China) 49(6):675\u2013684","journal-title":"Adv Math (China)"},{"issue":"19","key":"972_CR4","doi-asserted-by":"publisher","first-page":"6411","DOI":"10.2298\/FIL1919411C","volume":"33","author":"DM Cardoso","year":"2019","unstructured":"Cardoso DM, Cerdeira JO, Cruz JP, Dominic C (2019) Injective edge chromatic index of graphs. Filomat 33(19):6411\u20136423","journal-title":"Filomat"},{"key":"972_CR5","unstructured":"Ferdjallah B, Kerdjoudj S, Raspaud A (2020) Injective edge-coloring of sparse graphs. 349 https:\/\/arxiv.org\/abs\/1907.09838"},{"issue":"106121","key":"972_CR6","first-page":"9","volume":"170","author":"F Foucaud","year":"2021","unstructured":"Foucaud F, Hocquard H, Lajou D (2021) Complexity and algorithms for injective edge-coloring in graphs. Inform Process Lett 170(106121):9","journal-title":"Inform Process Lett"},{"issue":"103355","key":"972_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.37236\/9683","volume":"96","author":"A Kostochka","year":"2021","unstructured":"Kostochka A, Raspaud A, Xu J (2021) Injective edge-coloring of graphs with given maximum degree. European J Combin 96(103355):12","journal-title":"European J Combin"},{"key":"972_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2021.07.010","volume":"302","author":"JB Lv","year":"2021","unstructured":"Lv JB, Zhou JX, Nian NH (2021) List injective edge-coloring of subcubic graphs. Discrete Appl Math 302:163\u2013170","journal-title":"Discrete Appl Math"},{"key":"972_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2021.12.021","volume":"310","author":"ZK Miao","year":"2022","unstructured":"Miao ZK, Song YM, Yu GX (2022) Note on injective edge-coloring of graphs. Discrete Appl Math 310:65\u201374","journal-title":"Discrete Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00972-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00972-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00972-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:51:32Z","timestamp":1675497092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00972-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["972"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00972-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"19 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"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":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"46"}}