{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:25:03Z","timestamp":1778664303484,"version":"3.51.4"},"reference-count":3,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1137\/0210055","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:24:20Z","timestamp":1109226260000},"page":"718-720","source":"Crossref","is-referenced-by-count":800,"title":["The NP-Completeness of Edge-Coloring"],"prefix":"10.1137","volume":"10","author":[{"given":"Ian","family":"Holyer","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R1","volume-title":"Edge-colourings of graphs","author":"Fiorini S.","year":"1977"},{"key":"R2","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.2307\/2319844"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0210055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:21:32Z","timestamp":1485692492000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0210055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["10.1137\/0210055"],"URL":"https:\/\/doi.org\/10.1137\/0210055","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}