{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:10:29Z","timestamp":1767211829375,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10878-024-01234-7","type":"journal-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T16:01:13Z","timestamp":1730995273000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On injective chromatic index of sparse graphs with maximum degree 5"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5412-2818","authenticated-orcid":false,"given":"Jian","family":"Lu","sequence":"first","affiliation":[]},{"given":"Zhen-Mu","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Zheng-Jiang","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"1234_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0012-365X(98)00393-8","volume":"206","author":"OV Borodin","year":"1999","unstructured":"Borodin OV, Kostochka AV, Ne\u0161et\u0159il J, Raspaud A, Sopena E (1999) On the maximum average degree and the oriented chromatic number of a graph. Discrete Math 206:77\u201389","journal-title":"Discrete Math"},{"issue":"2","key":"1234_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":"19","key":"1234_CR3","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 coloring of graphs. Filomat 33(19):6411\u20136423","journal-title":"Filomat"},{"key":"1234_CR4","doi-asserted-by":"crossref","unstructured":"Ferdjallah B, Kerdjoudj S, Raspaud A (2020) Injective edge-coloring of sparse graphs. arXiv:1907.09838v2 [math.CO]","DOI":"10.1142\/S1793830922500409"},{"key":"1234_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106121","volume":"170","author":"F Foucaud","year":"2021","unstructured":"Foucaud F, Hocquard H, Lajou D (2021) Complexity and algorithms for injective edge-coloring in graphs. Inf Process Lett 170:106121","journal-title":"Inf Process Lett"},{"key":"1234_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s40840-022-01442-6","volume":"46","author":"XL Hu","year":"2023","unstructured":"Hu XL, Legass BM (2023) Injective edge chromatic index of generalized Petersen graphs. Bull Malays Math Sci Soc 46:37","journal-title":"Bull Malays Math Sci Soc"},{"key":"1234_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103355","volume":"96","author":"A Kostochka","year":"2021","unstructured":"Kostochka A, Raspaud A, Xu JW (2021) Injective edge-coloring of graphs with given maximum degree. European J Combin 96:103355","journal-title":"European J Combin"},{"key":"1234_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00373-022-02562-3","volume":"38","author":"J Lu","year":"2022","unstructured":"Lu J, Liu HQ, Hu XL (2022) Injective edge coloring for graphs with small edge weight. Graphs Combin 38:160","journal-title":"Graphs Combin"},{"key":"1234_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 G (2022) Note on injective edge-coloring of graphs. Discrete Appl Math 310:65\u201374","journal-title":"Discrete Appl Math"},{"key":"1234_CR10","first-page":"481","volume":"289","author":"J Yue","year":"2016","unstructured":"Yue J, Zhang SL, Zhang X (2016) Note on the perfect EIC-graphs. Appl Math Comput 289:481\u2013485","journal-title":"Appl Math Comput"},{"key":"1234_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.dam.2023.03.022","volume":"334","author":"JL Zhu","year":"2023","unstructured":"Zhu JL (2023) Injective edge coloring of graphs with maximum degree 5. Discrete Appl Math 334:119\u2013126","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-024-01234-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01234-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01234-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:24:11Z","timestamp":1732051451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01234-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,7]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1234"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01234-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,11,7]]},"assertion":[{"value":"29 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}