{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:55:56Z","timestamp":1772794556682,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"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":["12171239"],"award-info":[{"award-number":["12171239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004193","name":"Nanjing University of Aeronautics and Astronautics","doi-asserted-by":"publisher","award":["xcxjh20210802"],"award-info":[{"award-number":["xcxjh20210802"]}],"id":[{"id":"10.13039\/501100004193","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":[[2024,7]]},"DOI":"10.1007\/s10878-024-01188-w","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T18:02:22Z","timestamp":1720029742000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Injective edge-coloring of claw-free subcubic graphs"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0196-9265","authenticated-orcid":false,"given":"Qing","family":"Cui","sequence":"first","affiliation":[]},{"given":"Zhenmeng","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"1188_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N (1999) Combinatorial Nullstellensatz. Combin Probab Comput 8:7\u201329","journal-title":"Combin Probab Comput"},{"key":"1188_CR2","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, Urckerdt T (2019) Induced and weak induced arboricities. Discrete Math 342:511\u2013519","journal-title":"Discrete Math"},{"key":"1188_CR3","doi-asserted-by":"publisher","first-page":"1850022","DOI":"10.1142\/S1793830918500222","volume":"10","author":"Y Bu","year":"2018","unstructured":"Bu Y, Qi C (2018) Injective edge coloring of sparse graphs. Discrete Math Algorithms Appl 10:1850022","journal-title":"Discrete Math Algorithms Appl"},{"key":"1188_CR4","doi-asserted-by":"publisher","first-page":"6411","DOI":"10.2298\/FIL1919411C","volume":"33","author":"DM Cardoso","year":"2019","unstructured":"Cardoso DM, Cerdeira JO, Dominic C, Cruz JP (2019) Injective edge coloring of graphs. Filomat 33:6411\u20136423","journal-title":"Filomat"},{"key":"1188_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10878-011-9386-2","volume":"24","author":"M Chen","year":"2012","unstructured":"Chen M, Hahn G, Raspaud A, Wang W (2012) Some results on the injective chromatic number of graphs. J Combin Optim 24:299\u2013318","journal-title":"J Combin Optim"},{"key":"1188_CR6","doi-asserted-by":"publisher","first-page":"2965","DOI":"10.1016\/j.disc.2010.07.003","volume":"310","author":"DW Cranston","year":"2010","unstructured":"Cranston DW, Kim S-J, Yu G (2010) Injective colorings of sparse graphs. Discrete Math 310:2965\u20132973","journal-title":"Discrete Math"},{"key":"1188_CR7","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00453-010-9425-x","volume":"60","author":"DW Cranston","year":"2011","unstructured":"Cranston DW, Kim S-J, Yu G (2011) Injective colorings of graphs with low average degree. Algorithmica 60:553\u2013568","journal-title":"Algorithmica"},{"key":"1188_CR8","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1007\/s10878-022-00880-z","volume":"44","author":"Q Fang","year":"2022","unstructured":"Fang Q, Zhang L (2022) Sharp upper bound of injective coloring of planar graphs with girth at least $$5$$. J Combin Optim 44:1161\u20131198","journal-title":"J Combin Optim"},{"key":"1188_CR9","doi-asserted-by":"publisher","first-page":"2250040","DOI":"10.1142\/S1793830922500409","volume":"14","author":"B Ferdjallah","year":"2022","unstructured":"Ferdjallah B, Kerdjoudj S, Raspaud A (2022) Injective edge-coloring of subcubic graphs. Discrete Math Algorithms Appl 14:2250040","journal-title":"Discrete Math Algorithms Appl"},{"key":"1188_CR10","doi-asserted-by":"publisher","first-page":"106121","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. Inform Process Lett 170:106121","journal-title":"Inform Process Lett"},{"key":"1188_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn G, Kratochv\u00edl J, \u0160ir\u00e1\u0148 J, Sotteau D (2002) On the injective chromatic number of graphs. Discrete Math 256:179\u2013192","journal-title":"Discrete Math"},{"key":"1188_CR12","doi-asserted-by":"publisher","first-page":"103355","DOI":"10.1016\/j.ejc.2021.103355","volume":"96","author":"A Kostochka","year":"2021","unstructured":"Kostochka A, Raspaud A, Xu J (2021) Injective edge-coloring of graphs with given maximum degree. Eur J Combin 96:103355","journal-title":"Eur J Combin"},{"key":"1188_CR13","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 H, Hu X (2022) Injective edge coloring for graphs with small edge weight. Graphs Combin 38:160","journal-title":"Graphs Combin"},{"key":"1188_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2021.07.010","volume":"302","author":"J-B Lv","year":"2021","unstructured":"Lv J-B, Li J, Zhou N (2021) List injective edge-coloring of subcubic graphs. Discrete Appl Math 302:163\u2013170","journal-title":"Discrete Appl Math"},{"key":"1188_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2021.12.021","volume":"310","author":"Z Miao","year":"2022","unstructured":"Miao Z, Song Y, Yu G (2022) Note on injective edge-coloring of graphs. Discrete Appl Math 310:65\u201374","journal-title":"Discrete Appl Math"},{"key":"1188_CR16","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s00373-022-02582-z","volume":"38","author":"W Yang","year":"2022","unstructured":"Yang W, Wu B (2022) Injective edge-coloring of graphs with small weight. Graphs Combin 38:178","journal-title":"Graphs Combin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01188-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01188-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01188-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:42:09Z","timestamp":1721659329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01188-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1188"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01188-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"6 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"87"}}