{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:34:52Z","timestamp":1773866092351,"version":"3.50.1"},"reference-count":3,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":4034,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0893-9659(02)80007-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:47:31Z","timestamp":1034275651000},"page":"561-565","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":85,"title":["Choosability and edge choosability of planar graphs without five cycles"],"prefix":"10.1016","volume":"15","author":[{"given":"Weifan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ko-Wei","family":"Lih","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(02)80007-6_BIB1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(92)90602-C","article-title":"List edge chromatic number of graphs with large girth","volume":"101","author":"Kostochka","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0893-9659(02)80007-6_BIB2","article-title":"Problems and conjectures in extremal graph theory","author":"Harris","year":"1984"},{"key":"10.1016\/S0893-9659(02)80007-6_BIB3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R","article-title":"Graphs of degree 4 are 5-edge-choosable","volume":"32","author":"Juvan","year":"1999","journal-title":"J. Graph Theory"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902800076?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902800076?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:05:44Z","timestamp":1760238344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965902800076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":3,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0893965902800076"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(02)80007-6","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Choosability and edge choosability of planar graphs without five cycles","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(02)80007-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}