Abstract
Let \(G\) be a graph of order \(n\) and size \(m\). Suppose that \(f:V(G)\rightarrow {\mathbb {N}}\) is a function such that \(\sum _{v\in V(G)}f(v)=m+n\). In this paper we provide a criterion for \(f\)-choosability of \(G\). Using this criterion, it is shown that the choice number of the complete \(k\)-partite graph \(K_{2,2,\ldots ,2}\) is \(k\), which is a well-known result due to Erdös, Rubin and Taylor. Among other results we study the \(f\)-choosability of the complete \(k\)-partite graphs with part sizes at most \(2\), when \(f(v)\in \{k-1,k\}\), for every vertex \(v\in V(G)\).
Similar content being viewed by others
References
Akbari, S., Mirrokni, V.S., Sadjad, B.: A relation between choosability and uniquely list colorability. J. Combin. Theory Ser. B 96, 577–583 (2006)
Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12(2), 125–134 (1992)
Enotomo, H., Ohba, K., Ota, K., Sakamoto, J.: Choice number of some complete multipartite graphs. Discrete Math. 244, 55–56 (2002)
Erdös, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26, 125–157 (1980)
Hefetz, D.: On two generalizations of the Alon–Tarsi polynomial method. J. Combin. Theory. Ser. B 101(6), 403–414 (2011)
Kierstead, H.A.: On the choosability of complete multipartite graphs with part size three. Discrete Math. 211, 255–259 (2000)
Noel, J.A., Reed, B.A., Wu, H.: A proof of a conjecture of Ohba (2012, preprint). arXiv:1211.1999
Ohba, K.: On chromatic-choosable graphs. J. Graph Theory 40, 130–135 (2002)
Ohba, K.: Choice number of complete multipartite graphs with part size at most three. Ars Combin. 72, 133–139 (2004)
Prowse, A., Woodall, D.R.: Choosability of powers of circuits. Graphs Comb. 19, 137–144 (2003)
Reed, B., Sudakov, B.: List coloring when the chromatic number is close to the order of the graph. Combinatorica 25, 117–123 (2005)
Reed, B., Sudakov, B.: List colouring of graphs with at most \((2-o(1))\chi \) vertices. In: Proceedings of the International Congress of Mathematicians, vol. III, pp. 587–603. Higher Education Press, Beijing (2002)
Acknowledgments
The research of four first authors were in part supported by grants from IPM, No. 92050212, No. 92050220, No. 89050043 and No. 91130021, respectively.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Akbari, S., Kiani, D., Mohammadi, F. et al. An Algebraic Criterion for the Choosability of Graphs. Graphs and Combinatorics 31, 497–506 (2015). https://doi.org/10.1007/s00373-014-1411-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-014-1411-7