{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:09Z","timestamp":1781463309479,"version":"3.54.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.003","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:26:41Z","timestamp":1779449201000},"page":"399-412","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computational results on semistrong edge coloring of graphs"],"prefix":"10.1016","volume":"391","author":[{"given":"Yuquan","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4112-0469","authenticated-orcid":false,"given":"Wensong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.dam.2026.05.003_b1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jgt.1010","article-title":"Acyclic edge colorings of graphs","volume":"37","author":"Alon","year":"2001","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.dam.2026.05.003_b2","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s00453-001-0093-8","article-title":"Algorithmic aspects of acyclic edge colorings","volume":"32","author":"Alon","year":"2002","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.05.003_b3","series-title":"Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers 43","first-page":"100","article-title":"Uniquely restricted matchings and edge colorings","author":"Baste","year":"2017"},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.05.003_b4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","article-title":"Induced matchings","volume":"24","author":"Cameron","year":"1989","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.05.003_b5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","article-title":"Finding a maximum induced matching in weakly chordal graphs","volume":"266","author":"Cameron","year":"2003","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.003_b6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.tcs.2013.01.027","article-title":"New results on maximum induced matchings in bipartite graphs and beyond","volume":"478","author":"Dabrowski","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.05.003_b7","series-title":"Irregularities of Partitions","first-page":"162","article-title":"Problems","author":"Erd\u0151s","year":"1989"},{"key":"10.1016\/j.dam.2026.05.003_b8","first-page":"139","article-title":"Atsiklicheskij khromaticheskij klass grafa","volume":"28","author":"Fiam\u010dik","year":"1978","journal-title":"Math. Slovaca"},{"key":"10.1016\/j.dam.2026.05.003_b9","first-page":"141","article-title":"Strong edge-colorings of graphs and applications to multi-k-gons","volume":"16","author":"Fouquet","year":"1983","journal-title":"Ars Comb. A"},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.05.003_b10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disc.2004.08.027","article-title":"Generalized subgraph-restricted matchings in graphs","volume":"293","author":"Goddard","year":"2005","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.003_b11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00453-001-0004-z","article-title":"Uniquely restricted matchings","volume":"31","author":"Golumbic","year":"2001","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.05.003_b12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","article-title":"New results on induced matchings","volume":"101","author":"Golumbic","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.003_b13","series-title":"Studies in the Theory of Graphs","author":"Gupta","year":"1967"},{"key":"10.1016\/j.dam.2026.05.003_b14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.20061","article-title":"Semistrong edge coloring of graphs","volume":"49","author":"Gy\u00e1rf\u00e1s","year":"2005","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.dam.2026.05.003_b15","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10878-015-9983-6","article-title":"On (s,t)-relaxed strong edge-coloring of graphs","volume":"33","author":"He","year":"2017","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.05.003_b16","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge colorings","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.dam.2026.05.003_b17","doi-asserted-by":"crossref","first-page":"1876","DOI":"10.1137\/16M1058078","article-title":"Induced matchings in graphs of bounded maximum degree","volume":"30","author":"Joos","year":"2016","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"10.1016\/j.dam.2026.05.003_b18","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1016\/j.jcss.2010.09.001","article-title":"On the induced matching problem","volume":"77","author":"Kanj","year":"2011","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2026.05.003_b19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/j.dam.2026.05.003_b20","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1002\/jgt.23059","article-title":"Revisiting semistrong edge-coloring of graphs","volume":"105","author":"Lu\u017ear","year":"2024","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.003_b21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","article-title":"On the computational complexity of strong edge-coloring","volume":"118","author":"Mahdian","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.003_b22","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskretn. Anal."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:19Z","timestamp":1781460499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":22,"alternative-id":["S0166218X26002854"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.003","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computational results on semistrong edge coloring of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}