{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:39Z","timestamp":1740107139242,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T00:00:00Z","timestamp":1483660800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471273","11561058"],"award-info":[{"award-number":["11471273","11561058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00373-017-1763-x","type":"journal-article","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T14:17:54Z","timestamp":1483712274000},"page":"489-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a Version of Ohba\u2019s Conjecture for Improper Colorings"],"prefix":"10.1007","volume":"33","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhidan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,6]]},"reference":[{"key":"1763_CR1","first-page":"115","volume":"5","author":"J Carraher","year":"2014","unstructured":"Carraher, J., Loeb, S., Mahoney, T., Puleo, G.J., Tsai, M.-T., West, D.B.: Three topics in online list coloring. J. Comb. 5, 115\u2013130 (2014)","journal-title":"J. Comb."},{"key":"1763_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(01)00059-0","volume":"244","author":"H Enomote","year":"2002","unstructured":"Enomote, H., Ohba, K., Ota, K., Sakamoto, J.: Choice number of some complete multi-partite graphs. Discrete Math. 244, 55\u201366 (2002)","journal-title":"Discrete Math."},{"key":"1763_CR3","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26, 125\u2013157 (1979)"},{"key":"1763_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/(SICI)1097-0118(199802)27:2<87::AID-JGT4>3.0.CO;2-B","volume":"27","author":"S Gravier","year":"1998","unstructured":"Gravier, S., Maffray, F.: Graphs whose choice number is equal to their chromatic number. J. Graph Theory 27, 87\u201397 (1998)","journal-title":"J. Graph Theory"},{"key":"1763_CR5","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.ejc.2011.09.020","volume":"33","author":"P-Y Huang","year":"2012","unstructured":"Huang, P.-Y., Wong, T., Zhu, X.: Application of polynomial method to on-line list colouring of graphs. Eur. J. Comb. 33, 872\u2013883 (2012)","journal-title":"Eur. J. Comb."},{"key":"1763_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":"1763_CR7","doi-asserted-by":"crossref","unstructured":"Kim, S.-J., Kwon, Y.S. , Liu, D.D.-F., Zhu, X.: On-line list colouring of complete multipartite graphs. Electron. J. Comb. 19, 41 (2012)","DOI":"10.37236\/2050"},{"key":"1763_CR8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.dam.2014.08.004","volume":"180","author":"S-J Kim","year":"2015","unstructured":"Kim, S.-J., Kwon, Y.S., Park, B.: Chromatic-choosability of the power of graphs. Discrete Appl. Math. 180, 120\u2013125 (2015)","journal-title":"Discrete Appl. Math."},{"key":"1763_CR9","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.ejc.2013.07.003","volume":"36","author":"J Kozik","year":"2014","unstructured":"Kozik, J., Micek, P., Zhu, X.: Towards an on-line version of Ohba\u2019s conjecture. Eur. J. Comb. 36, 110\u2013121 (2014)","journal-title":"Eur. J. Comb."},{"key":"1763_CR10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/jgt.21802","volume":"78","author":"S-J Kim","year":"2015","unstructured":"Kim, S.-J., Park, B.: Counterexamples to the list square coloring conjecture. J. Graph Theory 78, 239\u2013247 (2015)","journal-title":"J. Graph Theory"},{"key":"1763_CR11","doi-asserted-by":"crossref","unstructured":"Kim, S.-J., Park, B.: Bipartite graphs whose squares are not chromatic-choosable. Electron. J. Comb. 22, 1.46 (2015)","DOI":"10.37236\/4343"},{"key":"1763_CR12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.disc.2014.05.008","volume":"332","author":"N Kosar","year":"2014","unstructured":"Kosar, N., Petrickova, S., Reiniger, B., Yeager, E.: A note on list-coloring powers of graphs. Discrete Math. 332, 10\u201314 (2014)","journal-title":"Discrete Math."},{"key":"1763_CR13","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.disc.2011.02.026","volume":"311","author":"AV Kostochka","year":"2011","unstructured":"Kostochka, A.V., Stiebitz, M., Woodall, D.R.: Ohba\u2019s conjecture for graphs with independence number five. Discrete Math. 311, 996\u20131005 (2011)","journal-title":"Discrete Math."},{"key":"1763_CR14","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1002\/jgt.21819","volume":"79","author":"JA Noel","year":"2015","unstructured":"Noel, J.A., Reed, B.A., Wu, H.: A proof of a conjecture of Ohba. J. Graph Theory 79, 86\u2013102 (2015)","journal-title":"J. Graph Theory"},{"key":"1763_CR15","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":"1763_CR16","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":"1763_CR17","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)"},{"key":"1763_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00493-005-0010-x","volume":"25","author":"B Reed","year":"2004","unstructured":"Reed, B., Sudakov, B.: List colouring when the chromatic number is close to the order of the graph. Combinatorica 25, 117\u2013123 (2004)","journal-title":"Combinatorica"},{"key":"1763_CR19","doi-asserted-by":"crossref","unstructured":"Schauz, U.: Proof of the list edge coloring conjecture for complete graphs of prime degree. Electron. J. Comb. 21, 3.43 (2014)","DOI":"10.37236\/4084"},{"key":"1763_CR20","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret Analiz 29, 3\u201310 (1976)","journal-title":"Diskret Analiz"},{"key":"1763_CR21","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1007\/s00373-014-1466-5","volume":"31","author":"W Wang","year":"2015","unstructured":"Wang, W., Wu, B., Yan, Z., Xue, N.: A weaker version of a conjecture on list vertex arboricity of graphs. Graphs Comb. 31, 1779\u20131787 (2015)","journal-title":"Graphs Comb."},{"key":"1763_CR22","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1007\/s00373-014-1438-9","volume":"31","author":"Z Yan","year":"2015","unstructured":"Yan, Z., Wang, W., Xue, N.: On improperly chromatic-choosable graphs. Graphs Comb. 31, 1807\u20131814 (2015)","journal-title":"Graphs Comb."},{"key":"1763_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00373-008-0827-3","volume":"25","author":"L Zhen","year":"2009","unstructured":"Zhen, L., Wu, B.: List point arboricity of dense graphs. Graphs Comb. 25, 123\u2013128 (2009)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1763-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1763-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1763-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T16:53:04Z","timestamp":1601311984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1763-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1763"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1763-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,1,6]]}}}