Abstract
For every vertex v in a graph G, let L(v) denote a list of colors assigned to v. A list coloring is a proper coloring f such that f(v) ∈ L(v) for all v. A graph is k-choosable if it admits a list coloring for every list assignment L with |L(v)| = k. The choice number of G is the minimum k such that G is k-choosable. We generalize a result (of [4]) concerning the choice numbers of complete bipartite graphs and prove some uniqueness results concerning the list colorability of the complete (k + 1)-partite graph Kn, ..., n, m. Using these, we determine the choice numbers for some complete multipartite graphs Kn,..., n, m. As a byproduct, we classify (i) completely those complete tripartite graphs K2, 2, m and (ii) almost completely those complete bipartite graphs Kn, m (for n ≤ 6) according to their choice numbers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
