{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:36Z","timestamp":1740107136442,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,23]],"date-time":"2015-09-23T00:00:00Z","timestamp":1442966400000},"content-version":"tdm","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":[[2016,5]]},"DOI":"10.1007\/s00373-015-1625-3","type":"journal-article","created":{"date-parts":[[2015,9,23]],"date-time":"2015-09-23T01:44:49Z","timestamp":1442972689000},"page":"851-859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Free Choosability of Outerplanar Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Yves","family":"Aubry","sequence":"first","affiliation":[]},{"given":"Jean-Christophe","family":"Godin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9510-3595","authenticated-orcid":false,"given":"Olivier","family":"Togni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,23]]},"reference":[{"issue":"166","key":"1625_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(96)00159-8","volume":"165","author":"N Alon","year":"1997","unstructured":"Alon, N., Tuza, Zs, Voigt, M.: Choosability and fractional chromatic number. Discret. Math. 165(166), 31\u201338 (1997)","journal-title":"Discret. Math."},{"key":"1625_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.dam.2013.09.028","volume":"166","author":"Y Aubry","year":"2014","unstructured":"Aubry, Y., Godin, J.-C., Togni, O.: Every triangle-free induced subgraph of the triangular lattice is $$(5m,2m)$$ ( 5 m , 2 m ) -choosable. Discret. Appl. Math. 166, 51\u201358 (2014)","journal-title":"Discret. Appl. Math."},{"key":"1625_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"key":"1625_CR4","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West-Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI, pp. 125\u2013157 (1979)"},{"key":"1625_CR5","unstructured":"Godin, J.-C.: Coloration et choisissabilit\u00e9 des graphes et applications. PhD Thesis (in french), Universit\u00e9 du Sud Toulon-Var, France (2009)"},{"key":"1625_CR6","doi-asserted-by":"crossref","first-page":"2260","DOI":"10.1016\/j.disc.2008.04.061","volume":"309","author":"S Gutner","year":"2009","unstructured":"Gutner, S., Tarsi, M.: Some results on (a:b)-choosability. Discret. Math. 309, 2260\u20132270 (2009)","journal-title":"Discret. Math."},{"key":"1625_CR7","doi-asserted-by":"crossref","unstructured":"Li, N., Meng, X., Liu, H.: Free Choosability of Outerplanar Graphs. In: Green Communications and Networks. Lecture Notes in Electrical Engineering, vol. 113, pp. 253\u2013256 (2012)","DOI":"10.1007\/978-94-007-2169-2_30"},{"key":"1625_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M","volume":"22","author":"Zs Tuza","year":"1996","unstructured":"Tuza, Zs, Voigt, M.: Every 2-choosable graph is (2m, m)-choosable. J. Graph Theory 22, 245\u2013252 (1996)","journal-title":"J. Graph Theory"},{"key":"1625_CR9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/0012-365X(95)00216-J","volume":"150","author":"M Voigt","year":"1996","unstructured":"Voigt, M.: Choosability of planar graphs. Discret. Math. 150, 457\u2013460 (1996)","journal-title":"Discret. Math."},{"key":"1625_CR10","volume-title":"On list Colourings and Choosability of Graphs","author":"M Voigt","year":"1998","unstructured":"Voigt, M.: On list Colourings and Choosability of Graphs. Abilitationsschrift, TU Ilmenau (1998)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1625-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1625-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1625-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:41Z","timestamp":1559041181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1625-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,23]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1625"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1625-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2015,9,23]]}}}