{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:17:22Z","timestamp":1760573842283,"version":"build-2065373602"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Harvard College Research Program, Harvard University"},{"DOI":"10.13039\/100010951","name":"Center of Mathematical Sciences and Applications, Harvard University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010951","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":[[2025,10]]},"DOI":"10.1007\/s00373-025-02957-y","type":"journal-article","created":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T13:04:10Z","timestamp":1757595850000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Counterexamples to a Conjecture by Woodall on Graph Minors and List Coloring"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-2146-3100","authenticated-orcid":false,"given":"Knut","family":"Vanderbush","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"4","key":"2957_CR1","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26(4), 125\u2013159 (1979). (https:\/\/old.renyi.hu\/\u00a0p_erdos\/1980-07.pdf)","journal-title":"Congr. Numer."},{"issue":"2","key":"2957_CR2","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"Hadwiger, H.: \u00dcber eine Klassifikation der Streckenkomplexe. Vierteljahrsschrift der Naturforschenden Gesellschaft in Z\u00fcrich 88(2), 133\u2013142 (1943). (https:\/\/www.ngzh.ch\/archiv\/1943_88\/88_2\/88_17.pdf)","journal-title":"Vierteljahrsschrift der Naturforschenden Gesellschaft in Z\u00fcrich"},{"issue":"2","key":"2957_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/PL00007245","volume":"17","author":"LK J\u00f8rgensen","year":"2001","unstructured":"J\u00f8rgensen, L.K.: Vertex partitions of $$K_{4,4}$$-minor free graphs. Graphs Comb. 17(2), 265\u2013274 (2001). https:\/\/doi.org\/10.1007\/PL00007245","journal-title":"Graphs Comb."},{"key":"2957_CR4","doi-asserted-by":"publisher","first-page":"P3.2","DOI":"10.37236\/10994","volume":"29.3","author":"R Steiner","year":"2022","unstructured":"Steiner, R.: Disproof of a conjecture by woodall on the choosability of $$K_{s, t}$$-minor free graphs. Electron. J. Comb. 29.3, P3.2 (2022). https:\/\/doi.org\/10.37236\/10994","journal-title":"Electron. J. Comb."},{"key":"2957_CR5","first-page":"269","volume":"288","author":"DR Woodall","year":"2001","unstructured":"Woodall, D.R.: List colourings of graphs. Lond. Math. Soc. Lecture Note Ser. 288, 269\u2013301 (2001). (https:\/\/www.researchgate.net\/profile\/Douglas-Woodall\/publication\/257575583_List_colourings_of_graphs\/links\/541d4b520cf2218008cf1521\/List-colourings-of-graphs.pdf)","journal-title":"Lond. Math. Soc. Lecture Note Ser."},{"issue":"1","key":"2957_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.10153","volume":"45","author":"DR Woodall","year":"2004","unstructured":"Woodall, D.R.: Defective choosability of graphs with no edge-plus-independent-set minor. J. Graph Theory 45(1), 51\u201356 (2004). https:\/\/doi.org\/10.1002\/jgt.10153","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02957-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02957-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02957-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:08:20Z","timestamp":1760504900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02957-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2957"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02957-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"18 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"103"}}