{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:26:56Z","timestamp":1648654016683},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"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":[[1992,3]]},"DOI":"10.1016\/0166-218x(92)90206-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"75-82","source":"Crossref","is-referenced-by-count":2,"title":["Edge colouring line graphs of unicyclic graphs"],"prefix":"10.1016","volume":"36","author":[{"given":"Leizhen","family":"Cai","sequence":"first","affiliation":[]},{"given":"John A.","family":"Ellis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90206-P_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0166-218X(91)90010-T","article-title":"NP-completeness of edge colouring some restricted graphs","volume":"30","author":"Cai","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90206-P_BIB2","article-title":"Edge-Colourings of Graphs","volume":"16","author":"Fiorini","year":"1977"},{"key":"10.1016\/0166-218X(92)90206-P_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(92)90206-P_BIB4","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-colouring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90206-P_BIB5","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)90206-P_BIB6","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","article-title":"The NP-completeness column: an ongoing guide","volume":"8","author":"Johnson","year":"1987","journal-title":"J. Algorithms"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290206P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290206P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:42Z","timestamp":1555136562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290206P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0166218X9290206P"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90206-p","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}