{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:04:59Z","timestamp":1757628299934,"version":"3.44.0"},"reference-count":16,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T00:00:00Z","timestamp":1749945600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>ABSTRACT<\/jats:title><jats:p>For a multiset  of positive integers, let . A \u2010list assignment of  is a list assignment  of  such that the colour set  can be partitioned into the disjoint union  of  sets so that for each  and each vertex  of , . We say  is \u2010choosable if  is \u2010colourable for any \u2010list assignment  of . The concept of \u2010choosability puts \u2010colourability and \u2010choosability in a same framework: If , then \u2010choosability is equivalent to \u2010choosability; if  consists of  copies of 1, then \u2010choosability is equivalent to \u2010colourability. If  is \u2010choosable, then  is \u2010colourable. On the other hand, there are \u2010colourable graphs that are not \u2010choosable, provided that  contains an integer larger than 1. Let  be the minimum number of vertices in a \u2010colourable non\u2010\u2010choosable graph. This paper determines the value of  for all .<\/jats:p>","DOI":"10.1002\/jgt.23267","type":"journal-article","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T01:52:07Z","timestamp":1750038727000},"page":"283-289","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Non\u2010Chromatic\u2010\u03bb\u2010Choosable Graphs"],"prefix":"10.1002","volume":"110","author":[{"given":"Jialu","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences Zhejiang Normal University Jinhua China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5502-5390","authenticated-orcid":false,"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences Zhejiang Normal University Jinhua China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_2_6_2_1","first-page":"125","volume-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State University, Arcata, CA, 1979), Congress. Numer., XXVI","author":"Erd\u0151s P.","year":"1980"},{"issue":"3","key":"e_1_2_6_3_1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/00029890.1996.12004729","article-title":"The Method of Undetermined Generalization and Specialization. Illustrated With Fred Galvin's Amazing Proof of the Dinitz Conjecture","volume":"103","author":"Zeilberger D.","year":"1996","journal-title":"American Mathematical Monthly"},{"key":"e_1_2_6_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1011"},{"key":"e_1_2_6_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02582936"},{"key":"e_1_2_6_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190160510"},{"key":"e_1_2_6_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139519793.018"},{"key":"e_1_2_6_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10033"},{"key":"e_1_2_6_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00059-0"},{"key":"e_1_2_6_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21819"},{"key":"e_1_2_6_11_1","doi-asserted-by":"crossref","unstructured":"J. A.Noel \u201cChoosability of Graphs With Bounded Order: Ohba's Conjecture and Beyond\u201d (master's thesis McGill University 2013).","DOI":"10.1016\/j.endm.2013.07.015"},{"key":"e_1_2_6_12_1","first-page":"1","article-title":"Minimum Non\u2010Chromatic\u2010Choosable Graphs With Given Chromatic Number","author":"Zhu J.","year":"2025","journal-title":"Canadian Journal of Mathematics"},{"key":"e_1_2_6_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2019.07.006"},{"key":"e_1_2_6_14_1","doi-asserted-by":"publisher","DOI":"10.37236\/7320"},{"key":"e_1_2_6_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1522413"},{"key":"e_1_2_6_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22718"},{"key":"e_1_2_6_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22998"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.23267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T06:10:13Z","timestamp":1757484613000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.23267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1002\/jgt.23267"],"URL":"https:\/\/doi.org\/10.1002\/jgt.23267","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2023-10-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}