{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:31:49Z","timestamp":1758054709352,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5191,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s0012-365x(98)00293-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"191-199","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Edge-choosability in line-perfect multigraphs"],"prefix":"10.1016","volume":"202","author":[{"given":"Dale","family":"Peterson","sequence":"first","affiliation":[]},{"given":"Douglas R.","family":"Woodall","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00293-3_BIB1","series-title":"Surveys in Combinatorics","first-page":"1","article-title":"Restricted colorings of graphs","volume":"vol. 187","author":"Alon","year":"1993"},{"key":"10.1016\/S0012-365X(98)00293-3_BIB2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1006\/jctb.1997.1780","article-title":"List edge and list total colourings of multigraphs","volume":"71","author":"Borodin","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00293-3_BIB3","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u00f6s","year":"1979"},{"key":"10.1016\/S0012-365X(98)00293-3_BIB4","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(98)00293-3_BIB5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00293-3_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(92)90028-V","article-title":"Kernels in perfect line-graphs","volume":"55","author":"Maffray","year":"1992","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00293-3_BIB7","first-page":"30","article-title":"Choosability of perfect line graphs","author":"Peterson","year":"1995"},{"key":"10.1016\/S0012-365X(98)00293-3_BIB8","first-page":"3","article-title":"Vertex colorings with given colors","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:S0012365X98002933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98002933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T05:57:50Z","timestamp":1757915870000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98002933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0012365X98002933"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00293-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1999,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-choosability in line-perfect multigraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(98)00293-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}