Chromatic choosability for some classes of perfect graphs.

A graph G = G(V,E) is called L-list colorable if there is a vertex coloring of G in which the color assigned to a vertex v is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(v) have the cardinality k and G is L-list colorable for all possible assignments of such lists. A graph G is said to be chromatic choosable if its chromatic and list chromatic numbers are equal. Investigation of χ-choosable graphs is one of the open problems. In this paper, we investigate this problem for classes of perfect graphs. [ABSTRACT FROM AUTHOR]