{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T01:20:52Z","timestamp":1777425652295,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0166-218x(01)00237-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:09:17Z","timestamp":1027595357000},"page":"239-248","source":"Crossref","is-referenced-by-count":49,"title":["On the computational complexity of strong edge coloring"],"prefix":"10.1016","volume":"118","author":[{"given":"Mohammad","family":"Mahdian","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00237-2_BIB1","doi-asserted-by":"crossref","unstructured":"J.C. Bermond, J. Bond, M. Paoli, C. Peyrat, Graphs and interconnection networks: diameter and vulnerability, in: Surveys in Combinatorics (Southampton), London Mathematical Society Lecture Note Series, Vol. 82, ed., E. Keith Lloyd, Cambridge Univ. Press, Cambridge, New York, 1983, pp. 1\u201330.","DOI":"10.1017\/CBO9781107325548.002"},{"key":"10.1016\/S0166-218X(01)00237-2_BIB2","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."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","article-title":"The maximum number of edges in 2K2-free graphs of bounded degree","volume":"81","author":"Chung","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","article-title":"Induced matchings in bipartite graphs","volume":"78","author":"Faudree","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB5","first-page":"205","article-title":"The strong chromatic index of graphs","volume":"29B","author":"Faudree","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB6","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00237-2_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(01)00237-2_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(93)90223-B","article-title":"Irredundancy in circular arc graphs","volume":"44","author":"Golumbic","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB9","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\/S0166-218X(01)00237-2_BIB10","unstructured":"C.W. Ko, F.B. Shepherd, Adding an identity to a totally unimodular matrix, Working Paper, London School of Economics Operations Research, LSEOR 94.14, July 1994."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB11","unstructured":"V. Kumar, Approximating Circular arc Coloring and Bandwidth Allocation in all-optical Ring Networks, Lecture Notes in Computer Science, Vol. 1444, Springer, Berlin, 1998, pp. 147\u2013158."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<357::AID-RSA9>3.0.CO;2-Y","article-title":"The strong chromatic index of C4-free graphs","volume":"17","author":"Mahdian","year":"2000","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0166-218X(01)00237-2_BIB13","unstructured":"M. Mahdian, The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, 2000."},{"key":"10.1016\/S0166-218X(01)00237-2_BIB14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02592052","article-title":"Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem","volume":"26","author":"McCormick","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00237-2_BIB15","doi-asserted-by":"crossref","unstructured":"A. Sen, M. Huson, A new model for scheduling packet radio networks, Proceedings of IEEE INFOCOM\u201996, Vol. 3, pp. 1116\u20131124.","DOI":"10.1109\/INFCOM.1996.493055"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002372?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T17:46:42Z","timestamp":1733248002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0166218X01002372"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00237-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}