{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:34:54Z","timestamp":1773866094723,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"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":[[1996,11]]},"DOI":"10.1016\/0012-365x(95)00104-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"119-130","source":"Crossref","is-referenced-by-count":66,"title":["The complexity of planar graph choosability"],"prefix":"10.1016","volume":"159","author":[{"given":"Shai","family":"Gutner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00104-5_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","article-title":"Colorings and orientations of graphs","volume":"12","author":"Alon","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(95)00104-5_BIB2","series-title":"Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing","first-page":"125","article-title":"Choosability in graphs","volume":"XXVI","author":"Erdős","year":"1979"},{"key":"10.1016\/0012-365X(95)00104-5_BIB3","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(95)00104-5_BIB4","unstructured":"S. Gutner and M. Tarsi, Some results on (a : b)-choosability, submitted."},{"key":"10.1016\/0012-365X(95)00104-5_BIB5","doi-asserted-by":"crossref","unstructured":"J. Kratochvil and Zs. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. in press.","DOI":"10.1016\/0166-218X(94)90150-3"},{"key":"10.1016\/0012-365X(95)00104-5_BIB6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00104-5_BIB7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","article-title":"On the complexity of the disjoint paths problem","volume":"13","author":"Middendorf","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(95)00104-5_BIB8","unstructured":"M. Stiebitz, private communication."},{"key":"10.1016\/0012-365X(95)00104-5_BIB9","article-title":"Every planar graph is 5-choosable","author":"Thomassen","year":"1993"},{"key":"10.1016\/0012-365X(95)00104-5_BIB10","article-title":"3-list-coloring planar graphs of girth 5","author":"Thomassen","year":"1994"},{"key":"10.1016\/0012-365X(95)00104-5_BIB11","series-title":"Diskret. Analiz. No. 29","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors","volume":"101","author":"Vizing","year":"1976"},{"key":"10.1016\/0012-365X(95)00104-5_BIB12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","article-title":"List colourings of planar graphs","volume":"120","author":"Voigt","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00104-5_BIB13","doi-asserted-by":"crossref","unstructured":"M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math., in press.","DOI":"10.1016\/0012-365X(94)00180-9"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95001045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95001045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:30:20Z","timestamp":1556350220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95001045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0012365X95001045"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00104-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}