{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T00:32:32Z","timestamp":1693009952415},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T00:00:00Z","timestamp":1411430400000},"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":[[2015,9]]},"DOI":"10.1007\/s00373-014-1466-5","type":"journal-article","created":{"date-parts":[[2014,9,22]],"date-time":"2014-09-22T02:16:41Z","timestamp":1411352201000},"page":"1779-1787","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhidan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nini","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,23]]},"reference":[{"key":"1466_CR1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1002\/jgt.20394","volume":"62","author":"OV Borodin","year":"2009","unstructured":"Borodin, O.V., Ivanova, A.O.: Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. J. Graph Theory 62, 234\u2013240 (2009)","journal-title":"J. Graph Theory"},{"key":"1466_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(99)00221-6","volume":"214","author":"OV Borodin","year":"2000","unstructured":"Borodin, O.V., Kostochka, A.V., Toft, B.: Variable degeneracy: extensions of Brooks and Gallais theorems. Discrete Math. 214, 101\u2013112 (2000)","journal-title":"Discrete Math."},{"key":"1466_CR3","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1112\/jlms\/s1-44.1.612","volume":"44","author":"G Chartrand","year":"1969","unstructured":"Chartrand, G., Kronk, H.V.: The point-arboricity of planar graphs. J. Lond. Math. Soc. 44, 612\u2013616 (1969)","journal-title":"J. Lond. Math. Soc."},{"key":"1466_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02760181","volume":"6","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G., Kronk, H.V., Wall, C.E.: The point-arboricity of a graph. Isr. J. Math. 6, 169\u2013175 (1968)","journal-title":"Isr. J. Math."},{"key":"1466_CR5","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Cong. Numer. 26, 125\u2013157 (1979)","journal-title":"Cong. Numer."},{"key":"1466_CR6","unstructured":"Noel, J.A.; Reed, B.A.; Wu, H.: A proof of a conjecture of Ohba (preprint). arXiv: 1211.1999 (2012)"},{"key":"1466_CR7","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":"1466_CR8","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","volume":"29","author":"A Raspaud","year":"2008","unstructured":"Raspaud, A., Wang, W.: On the vertex-arboricity of planar graphs. Eur. J. Comb. 29, 1064\u20131075 (2008)","journal-title":"Eur. J. Comb."},{"key":"1466_CR9","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":"1466_CR10","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":"1466_CR11","first-page":"457","volume":"105","author":"N Xue","year":"2012","unstructured":"Xue, N., Wang, W.: The list point arboricity of some complete multi-partite graphs. Ars Comb. 105, 457\u2013462 (2012)","journal-title":"Ars Comb."},{"key":"1466_CR12","doi-asserted-by":"crossref","unstructured":"Xue, N., Wu, B.: List point arboricity of graphs. Discrete Math. Algorithms Appl. 4, 1250027 (2012)","DOI":"10.1142\/S1793830912500279"},{"key":"1466_CR13","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-014-1466-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1466-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1466-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:38Z","timestamp":1559041178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1466-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,23]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1466"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1466-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,23]]}}}