{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:21:47Z","timestamp":1648765307723},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,22]],"date-time":"2014-03-22T00:00:00Z","timestamp":1395446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00373-014-1411-7","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T03:38:26Z","timestamp":1395373106000},"page":"497-506","source":"Crossref","is-referenced-by-count":0,"title":["An Algebraic Criterion for the Choosability of Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Saieed","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariush","family":"Kiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatemeh","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somayeh","family":"Moradi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Rahmati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,22]]},"reference":[{"key":"1411_CR1","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/j.jctb.2005.12.001","volume":"96","author":"S Akbari","year":"2006","unstructured":"Akbari, S., Mirrokni, V.S., Sadjad, B.: A relation between choosability and uniquely list colorability. J. Combin. Theory Ser. B 96, 577\u2013583 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1411_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12(2), 125\u2013134 (1992)","journal-title":"Combinatorica"},{"key":"1411_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(01)00059-0","volume":"244","author":"H Enotomo","year":"2002","unstructured":"Enotomo, H., Ohba, K., Ota, K., Sakamoto, J.: Choice number of some complete multipartite graphs. Discrete Math. 244, 55\u201356 (2002)","journal-title":"Discrete Math."},{"key":"1411_CR4","first-page":"125","volume":"26","author":"P Erd\u00f6s","year":"1980","unstructured":"Erd\u00f6s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26, 125\u2013157 (1980)","journal-title":"Congr. Numer."},{"issue":"6","key":"1411_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.jctb.2010.12.007","volume":"101","author":"D Hefetz","year":"2011","unstructured":"Hefetz, D.: On two generalizations of the Alon\u2013Tarsi polynomial method. J. Combin. Theory. Ser. B 101(6), 403\u2013414 (2011)","journal-title":"J. Combin. Theory. Ser. B"},{"key":"1411_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(99)00157-0","volume":"211","author":"HA Kierstead","year":"2000","unstructured":"Kierstead, H.A.: On the choosability of complete multipartite graphs with part size three. Discrete Math. 211, 255\u2013259 (2000)","journal-title":"Discrete Math."},{"key":"1411_CR7","unstructured":"Noel, J.A., Reed, B.A., Wu, H.: A proof of a conjecture of Ohba (2012, preprint). arXiv:1211.1999"},{"key":"1411_CR8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/jgt.10033","volume":"40","author":"K Ohba","year":"2002","unstructured":"Ohba, K.: On chromatic-choosable graphs. J. Graph Theory 40, 130\u2013135 (2002)","journal-title":"J. Graph Theory"},{"key":"1411_CR9","first-page":"133","volume":"72","author":"K Ohba","year":"2004","unstructured":"Ohba, K.: Choice number of complete multipartite graphs with part size at most three. Ars Combin. 72, 133\u2013139 (2004)","journal-title":"Ars Combin."},{"key":"1411_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00373-002-0486-8","volume":"19","author":"A Prowse","year":"2003","unstructured":"Prowse, A., Woodall, D.R.: Choosability of powers of circuits. Graphs Comb. 19, 137\u2013144 (2003)","journal-title":"Graphs Comb."},{"key":"1411_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00493-005-0010-x","volume":"25","author":"B Reed","year":"2005","unstructured":"Reed, B., Sudakov, B.: List coloring when the chromatic number is close to the order of the graph. Combinatorica 25, 117\u2013123 (2005)","journal-title":"Combinatorica"},{"key":"1411_CR12","unstructured":"Reed, B., Sudakov, B.: List colouring of graphs with at most $$(2-o(1))\\chi $$ ( 2 - o ( 1 ) ) \u03c7 vertices. In: Proceedings of the International Congress of Mathematicians, vol. III, pp. 587\u2013603. Higher Education Press, Beijing (2002)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1411-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1411-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1411-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:37Z","timestamp":1559041177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1411-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,22]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1411"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1411-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,22]]}}}