{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:41Z","timestamp":1740107141847,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T00:00:00Z","timestamp":1500508800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00373-017-1833-0","type":"journal-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:16:55Z","timestamp":1500545815000},"page":"1181-1187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Color Critical Graphs with Large Adaptable Chromatic Numbers"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2634-1527","authenticated-orcid":false,"given":"Bing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,20]]},"reference":[{"key":"1833_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(99)00219-8","volume":"214","author":"AF Archer","year":"2000","unstructured":"Archer, A.F.: On the upper chromatic numbers of the reals. Discrete Math. 214, 65\u201375 (2000)","journal-title":"Discrete Math."},{"key":"1833_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1833_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.4064\/fm-40-1-42-55","volume":"40","author":"GA Dirac","year":"1953","unstructured":"Dirac, G.A.: The structure of k-chromatic graphs. Fund. Math. 40, 42\u201355 (1953)","journal-title":"Fund. Math."},{"key":"1833_CR4","doi-asserted-by":"crossref","unstructured":"Greene, J.E.: Chromatic capacities of graphs and hypergraphs. Discrete Math. 281, 197\u2013207 (2004)","DOI":"10.1016\/j.disc.2003.06.016"},{"key":"1833_CR5","unstructured":"Haj\u00f3s, G.: \u00dcber eine konstruktion nicht n-f\u00e4rbbarer graphen, Wiss. Z. Martin-Luther-Univ. Halle-Wittenber Math.-Natur. Reihe 10, 116\u2013117 (1961)"},{"key":"1833_CR6","doi-asserted-by":"crossref","first-page":"6153","DOI":"10.1016\/j.disc.2009.05.029","volume":"309","author":"P Hell","year":"2009","unstructured":"Hell, P., Pan, Z., Wong, T.-L., Zhu, X.: Adaptable chromatic number of graph products. Discrete Math. 309, 6153\u20136159 (2009)","journal-title":"Discrete Math."},{"key":"1833_CR7","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejc.2007.11.015","volume":"29","author":"P Hell","year":"2008","unstructured":"Hell, P., Zhu, X.: On the adaptable chromatic number of graphs. Eur. J. Comb. 29, 912\u2013921 (2008)","journal-title":"Eur. J. Comb."},{"key":"1833_CR8","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1016\/j.disc.2006.10.021","volume":"308","author":"J Huizenga","year":"2008","unstructured":"Huizenga, J.: Chromatic capacity and graph operations. Discrete Math. 308, 2134\u20132148 (2008)","journal-title":"Discrete Math."},{"key":"1833_CR9","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.ejc.2011.11.001","volume":"33","author":"HA Kierstead","year":"2012","unstructured":"Kierstead, H.A., Chung-Ying, C.-Y., Yang, D., Zhu, X.: Adapted game colouring of graphs. Eur. J. Comb. 33, 435\u2013445 (2012)","journal-title":"Eur. J. Comb."},{"key":"1833_CR10","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/070698385","volume":"22","author":"AV Kostochka","year":"2008","unstructured":"Kostochka, A.V., Zhu, X.: Adapted list coloring of graphs and hypergraphs. SIAM J. Discrete Math. 22, 398\u2013408 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"1833_CR11","doi-asserted-by":"publisher","unstructured":"Molloy, M.: The adaptable chromatic number and the chromatic number. J. Graph Theory (2016). doi:\n                        10.1002\/jgt.22011","DOI":"10.1002\/jgt.22011"},{"key":"1833_CR12","doi-asserted-by":"crossref","first-page":"2268","DOI":"10.1016\/j.disc.2011.06.016","volume":"311","author":"M Molloy","year":"2011","unstructured":"Molloy, M., Thron, G.: The adaptable choosability number grows with the choosability number. Discrete Math. 311, 2268\u20132271 (2011)","journal-title":"Discrete Math."},{"key":"1833_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/jgt.20649","volume":"71","author":"M Molloy","year":"2012","unstructured":"Molloy, M., Thron, G.: An asymptotically tight bound on the adaptable chromatic number. J. Graph Theory 71, 331\u2013351 (2012)","journal-title":"J. Graph Theory"},{"key":"1833_CR14","unstructured":"West, D.B.: Introduction to graph theory, 2nd edn. Prentice Hall Inc., Upper Saddle River (2001)"},{"key":"1833_CR15","doi-asserted-by":"crossref","first-page":"2452","DOI":"10.1016\/j.disc.2010.05.022","volume":"310","author":"B Zhou","year":"2010","unstructured":"Zhou, B.: On a construction of graphs with high chromatic capacity and large girth. Discrete Math. 310, 2452\u20132454 (2010)","journal-title":"Discrete Math."},{"key":"1833_CR16","doi-asserted-by":"crossref","first-page":"2146","DOI":"10.1016\/j.disc.2013.05.012","volume":"313","author":"B Zhou","year":"2013","unstructured":"Zhou, B.: A lower bound for the chromatic capacity in terms of the chromatic number of a graph. Discrete Math. 313, 2146\u20132149 (2013)","journal-title":"Discrete Math."},{"key":"1833_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/jgt.20391","volume":"62","author":"X Zhu","year":"2009","unstructured":"Zhu, X., Esperet, L., Montassier, M.: Adapted list coloring of planar graphs. J. Graph Theory 62, 127\u2013138 (2009)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1833-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1833-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1833-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T15:35:37Z","timestamp":1508427337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1833-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,20]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1833"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1833-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,7,20]]}}}