{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:32:12Z","timestamp":1649071932393},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":5737,"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":[[1997,11]]},"DOI":"10.1016\/s0166-218x(97)00046-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"247-256","source":"Crossref","is-referenced-by-count":2,"title":["List colorings and reducibility"],"prefix":"10.1016","volume":"79","author":[{"given":"Zs.","family":"Tuza","sequence":"first","affiliation":[]},{"given":"M.","family":"Voigt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00046-2_BIB1_1","series-title":"Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing","article-title":"Choosability in graphs","author":"Erd\u00f6s","year":"1979"},{"key":"10.1016\/S0166-218X(97)00046-2_BIB1_2","first-page":"125","volume":"26","author":"Erd\u00f6s","year":"1979"},{"key":"10.1016\/S0166-218X(97)00046-2_BIB2","first-page":"69","article-title":"On a conjecture of Erd\u00f6s, Rubin and Taylor","volume":"9","author":"Tuza","year":"1996","journal-title":"Tatra Mountains Math. Publ."},{"key":"10.1016\/S0166-218X(97)00046-2_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M","article-title":"Every 2-choosable graph is (2m, m)-choosable","volume":"22","author":"Tuza","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00046-2_BIB4","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors (in Russian)","volume":"101","author":"Vizing","year":"1976","journal-title":"Diskret. Analiz. No. 29, Metody Diskret. Anal, v Teorii Kodov i Schem"},{"key":"10.1016\/S0166-218X(97)00046-2_BIB5","doi-asserted-by":"crossref","DOI":"10.7151\/dmgt.1049","article-title":"Graph colorings with local constraints \u2014 A survey","volume":"17","author":"Tuza","year":"1997","journal-title":"Discussiones Mathematicae Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:47Z","timestamp":1556666807000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0166218X97000462"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00046-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}