{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:13:31Z","timestamp":1783750411637,"version":"3.55.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"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":[[2026,8]]},"DOI":"10.1007\/s10878-026-01442-3","type":"journal-article","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:43:58Z","timestamp":1783748638000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neighbor-distinguishing index of IC-planar graphs"],"prefix":"10.1007","volume":"52","author":[{"given":"Zhengyue","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lina","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,11]]},"reference":[{"key":"1442_CR1","doi-asserted-by":"publisher","first-page":"3005","DOI":"10.1016\/j.disc.2004.12.027","volume":"306","author":"S Akbari","year":"2006","unstructured":"Akbari S, Bidkhori H, Nosrati N (2006) r-Strong edge colorings of graphs. Discrete Math 306:3005\u20133010","journal-title":"Discrete Math"},{"key":"1442_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.dam.2022.01.003","volume":"313","author":"XH Cheng","year":"2022","unstructured":"Cheng XH, Wang B, Wang JH (2022) The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11. Discrete Appl Math 313:29\u201339","journal-title":"Discrete Appl Math"},{"key":"1442_CR3","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","volume":"95","author":"H Hatami","year":"2005","unstructured":"Hatami H (2005) $$\\Delta (G)$$ + 300 is a bound on the adjacent vertex distinguishing edge chromatic number. J Combin Theory Ser B 95:246\u2013256","journal-title":"J Combin Theory Ser B"},{"key":"1442_CR4","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1002\/jgt.21764","volume":"76","author":"M Hor\u0148\u00e1k","year":"2014","unstructured":"Hor\u0148\u00e1k M, Huang DJ, Wang WF (2014) On neighbor-distinguishing index of a graph. J Graph Theory 76:262\u2013278","journal-title":"J Graph Theory"},{"key":"1442_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.dam.2022.12.023","volume":"329","author":"DJ Huang","year":"2023","unstructured":"Huang DJ, Cai HF, Wang WF, Huo JJ (2023) Neighbor-distinguishing indices of planar graphs with maximum degree ten. Discrete Appl Math 329:49\u201360","journal-title":"Discrete Appl Math"},{"issue":"7","key":"1442_CR6","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.3390\/sym14071289","volume":"14","author":"JJ Huo","year":"2022","unstructured":"Huo JJ, Li MC, Wang Y (2022) A characterization for the neighbor-distinguishing index of planar graphs. Symmetry 14(7):1289","journal-title":"Symmetry"},{"key":"1442_CR7","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1137\/18M1200427","volume":"34","author":"G Joret","year":"2020","unstructured":"Joret G, Lochet W (2020) Progress on the adjacent vertex distinguishing edge coloring conjecture. SIAM J Discrete Math 34:2221\u20132238","journal-title":"SIAM J Discrete Math"},{"key":"1442_CR8","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/s10878-021-00807-0","volume":"43","author":"ZY Liu","year":"2022","unstructured":"Liu ZY, Xu CQ (2022) Adjacent vertex distinguishing edge coloring of IC-planar graphs. J Comb Optim 43:710\u2013726","journal-title":"J Comb Optim"},{"key":"1442_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.dam.2023.05.010","volume":"337","author":"L Sun","year":"2023","unstructured":"Sun L, Yu GL, Li X (2023) Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23. Discrete Appl Math 337:257\u2013271","journal-title":"Discrete Appl Math"},{"key":"1442_CR10","doi-asserted-by":"publisher","first-page":"3092","DOI":"10.1016\/j.disc.2017.07.005","volume":"340","author":"B Vu\u010dkovi\u0107","year":"2017","unstructured":"Vu\u010dkovi\u0107 B (2017) Edge-partitions of graphs and their neighbor-distinguishing index. Discrete Math 340:3092\u20133096","journal-title":"Discrete Math"},{"key":"1442_CR11","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1137\/120903178","volume":"29","author":"WF Wang","year":"2015","unstructured":"Wang WF, Huang DJ (2015) A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree. SIAM J Discrete Math 29:2412\u20132431","journal-title":"SIAM J Discrete Math"},{"key":"1442_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s40840-021-01213-9","volume":"45","author":"WF Wang","year":"2022","unstructured":"Wang WF, Xia WJ, Huo JJ, Wang YQ (2022) On the neighbor-distinguishing indices of planar graphs. Bull Malays Math Sci Soc 45:677\u2013696","journal-title":"Bull Malays Math Sci Soc"},{"key":"1442_CR13","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1016\/j.disc.2015.05.007","volume":"338","author":"YQ Wang","year":"2015","unstructured":"Wang YQ, Wang WF, Huo JJ (2015) Some bounds on the neighbor-distinguishing index of graphs. Discrete Math 338:2006\u20132013","journal-title":"Discrete Math"},{"key":"1442_CR14","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.dam.2013.08.038","volume":"162","author":"LZ Zhang","year":"2014","unstructured":"Zhang LZ, Wang WF, Lih K-W (2014) An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Discrete Appl Math 162:348\u2013354","journal-title":"Discrete Appl Math"},{"key":"1442_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"ZF Zhang","year":"2002","unstructured":"Zhang ZF, Liu LZ, Wang JF (2002) Adjacent strong edge coloring of graphs. Appl Math Lett 15:623\u2013626","journal-title":"Appl Math Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01442-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01442-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01442-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:43:59Z","timestamp":1783748639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01442-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,11]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1442"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01442-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,11]]},"assertion":[{"value":"20 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2026","order":3,"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 conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"2"}}