A Note on the Equitable Choosability of Complete Bipartite Graphs

Abstract

In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitableIn this note we study the equitable choosability of complete bipartite graphs. A result of Kostochka, Pelsmajer, and West impliesWe also give a complete characterization of the equitable choosability of complete bipartite graphs that have a partite set of size at most 2.