{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:51:12Z","timestamp":1748321472134},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00230-6","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"137-149","source":"Crossref","is-referenced-by-count":8,"title":["On list edge-colorings of subcubic graphs"],"prefix":"10.1016","volume":"187","author":[{"given":"Martin","family":"Juvan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riste","family":"S\u02c7krekovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00230-6_bib1","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erdo\u02dds","year":"1979"},{"key":"10.1016\/S0012-365X(97)00230-6_bib2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","article-title":"The list chromatic index of a bipartite multigraph","volume":"63","author":"Galvin","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(97)00230-6_bib3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1017\/S0963548397002927","article-title":"New bounds on the list-chromatic index of the complete graph and other simple graphs","volume":"6","author":"Ha\u00a8ggkvist","year":"1997","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(97)00230-6_bib4","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0012-365X(97)00230-6_bib5","first-page":"3","article-title":"Colouring the vertices of a graph in prescribed colours","volume":"29","author":"Vizing","year":"1976","journal-title":"Metody Diskret. Analiz."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:55:03Z","timestamp":1556445303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002306"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00230-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}