{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:58Z","timestamp":1759063438868},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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,6]]},"DOI":"10.1016\/s0166-218x(96)00127-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"225-238","source":"Crossref","is-referenced-by-count":1,"title":["Amenable colorings"],"prefix":"10.1016","volume":"76","author":[{"given":"N.V.R.","family":"Mahadev","sequence":"first","affiliation":[]},{"given":"Fred S.","family":"Roberts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00127-8_BIB1","first-page":"69","article-title":"Cliques, colorings, and locally perfect graphs","volume":"39","author":"Albertson","year":"1983"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB2","series-title":"Proceedings of the 14th British Combinatorics Conference","first-page":"1","article-title":"Restricted colorings of graphs","author":"Alon","year":"1993"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB3","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\/S0166-218X(96)00127-8_BIB4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02582936","article-title":"List-colourings of graphs","volume":"1","author":"Bollob\u00e1s","year":"1985","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(96)00127-8_BIB5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(89)90199-4","article-title":"A new upper bound for the list chromatic number","volume":"74","author":"Bollob\u00e1s","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(96)00127-8_BIB6","series-title":"Graph theory with applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(90)90113-V","article-title":"Graph coloring satisfying restraints","volume":"80","author":"Brown","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(96)00127-8_BIB8","series-title":"Graph Colourings","first-page":"65","article-title":"Total colourings of graphs","author":"Chetwynd","year":"1990"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190130112","article-title":"A note on list-colourings","volume":"13","author":"Chetwynd","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB10","series-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erd\u00f3s","year":"1979"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB11","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\/S0166-218X(96)00127-8_BIB12","author":"Gutner","year":"1992"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/jgt.3190160510","article-title":"Some upper bounds on the total and list chromatic numbers of multigraphs","volume":"16","author":"H\u00e4ggkvist","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB14","series-title":"Combinatorial Theory","author":"Hall","year":"1986"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB15","unstructured":"D. Hanson, G. MacGillivray and B. Toft, Choosability of bipartite graphs, Ars Combin., to appear."},{"key":"10.1016\/S0166-218X(96)00127-8_BIB16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0166-218X(94)90150-3","article-title":"Algorithmic complexity of list colorings","volume":"50","author":"Kratochvil","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00127-8_BIB17","article-title":"3-choosable complete bipartite graphs","author":"Mahadev","year":"1991"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB18","article-title":"T-colorings, list T-colorings, and set T-colorings of graphs","author":"Tesman","year":"1989"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB19","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jctb.1994.1062","article-title":"Every planar graph is 5-choosable","volume":"62","author":"Thomassen","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/jctb.1995.1027","article-title":"3 list-coloring planar graphs of girth 5","volume":"64","author":"Thomassen","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0095-8956(74)90057-4","article-title":"Color-critical graphs and hypergraphs","volume":"16","author":"Toft","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(96)00127-8_BIB22","first-page":"3","article-title":"Vertex colorings with given colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Diskret. Analiz."},{"key":"10.1016\/S0166-218X(96)00127-8_BIB23","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\/S0166-218X(96)00127-8_BIB24","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(94)00180-9","article-title":"A not 3-choosable planar graph without 3-cycles","volume":"146","author":"Voigt","year":"1995","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:30:27Z","timestamp":1555983027000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96001278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0166218X96001278"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00127-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}