{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:18:26Z","timestamp":1753885106146,"version":"3.41.2"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:p> A graph [Formula: see text] is called [Formula: see text]-list colorable if there is a vertex coloring of [Formula: see text] in which the color assigned to a vertex [Formula: see text] is chosen from a list [Formula: see text] associated with this vertex. We say [Formula: see text] is [Formula: see text]-choosable if all lists [Formula: see text] have the cardinality [Formula: see text] and [Formula: see text] is [Formula: see text]-list colorable for all possible assignments of such lists. A graph [Formula: see text] is said to be chromatic choosable if its chromatic and list chromatic numbers are equal. Investigation of [Formula: see text]-choosable graphs is one of the open problems. In this paper, we investigate this problem for classes of perfect graphs. <\/jats:p>","DOI":"10.1142\/s1793830924500332","type":"journal-article","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T09:06:34Z","timestamp":1712221594000},"source":"Crossref","is-referenced-by-count":2,"title":["Chromatic choosability for some classes of perfect graphs"],"prefix":"10.1142","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0692-2435","authenticated-orcid":false,"given":"Nandana K.","family":"Vasudevan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences-Coimbatore, Amrita Vishwa Vidyapeetham, Coimbatore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0558-5389","authenticated-orcid":false,"given":"J.","family":"Geetha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences-Coimbatore, Amrita Vishwa Vidyapeetham, Coimbatore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2226-1845","authenticated-orcid":false,"given":"K.","family":"Somasundaram","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences-Coimbatore, Amrita Vishwa Vidyapeetham, Coimbatore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"key":"S1793830924500332BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.09.024"},{"volume-title":"Introductory Combinatorics","year":"1977","author":"Brualdi R. A","key":"S1793830924500332BIB002"},{"key":"S1793830924500332BIB003","first-page":"125","volume-title":"Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium","volume":"26","author":"Erd\u00f6s P.","year":"1979"},{"key":"S1793830924500332BIB004","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199802)27:2<87::AID-JGT4>3.0.CO;2-B"},{"key":"S1793830924500332BIB005","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1963-001-x"},{"volume-title":"Threshold Graphs and Related Topics","year":"1995","author":"Mahadev N. V. R.","key":"S1793830924500332BIB006"},{"key":"S1793830924500332BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.05.021"},{"key":"S1793830924500332BIB008","first-page":"15","volume":"68","author":"Mohan S.","year":"2017","journal-title":"Australas. J Combin."},{"key":"S1793830924500332BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10033"},{"issue":"3","key":"S1793830924500332BIB010","first-page":"10","volume":"29","author":"Vizing V. G.","year":"1976","journal-title":"Diskret. Anal."},{"key":"S1793830924500332BIB011","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"S1793830924500332BIB012","volume-title":"Introduction to Graph Theory","volume":"2","author":"West D. B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830924500332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T04:31:47Z","timestamp":1738038707000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830924500332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":12,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.1142\/S1793830924500332"],"URL":"https:\/\/doi.org\/10.1142\/s1793830924500332","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"article-number":"2450033"}}