Abstract
A graph G is called chromatic-choosable if its choice number is equal to its chromatic number, namely ch(G) = χ(G). Ohba’s conjecture states that every graph G with 2χ(G)+1 or fewer vertices is chromaticchoosable. It is clear that Ohba’s conjecture is true if and only if it is true for complete multipartite graphs. Recently, Kostochka, Stiebitz andWoodall showed that Ohba’s conjecture holds for complete multipartite graphs with partite size at most five. But the complete multipartite graphs with no restriction on their partite size, for which Ohba’s conjecture has been verified are nothing more than the graphs K t+2,3,2∗(k−t−2),1∗t by Enotomo et al., and K t+2,3,2∗(k−t−2),1∗t for t ≤ 4 by Shen et al.. In this paper, using the concept of f-choosable (or L 0-size-choosable) of graphs, we show that Ohba’s conjecture is also true for the graphs K t+2,3,2∗(k−t−2),1∗t when t ≥ 5. Thus, Ohba’s conjecture is true for graphs K t+2,3,2∗(k−t−2),1∗t for all integers t ≥ 1.
Similar content being viewed by others
References
Enotomo, H., Ohba, K., Ota, K., Sakamoto, J. Choice number of some complete multipartite graphs. Discrete Math., 244: 55–66 (2002)
Erdös, P., Rubin, A.L., Taylor, H. Choosability in graphs. Congr. Numer., 26: 125–157 (1979)
Gravier, S., Maffray, F. Graphs whose choice number is equal to their chromatic number. J. of Graph Theory, 27: 87–97 (1998)
He, W., Zhang, L., Cranston, Daniel W., Shen, Y., Zheng, G. Choice number of complete multipartite graphs K3*3,2*(k-5),1*2 and K4,3*2,2*(k-6),1*3. Discrete Math., 308: 5871–5877 (2008)
Kierstead, H.A. On the choosability of complete multipartite graphs with part size three. Discrete Math., 211: 255–259 (2000)
Kostochka, A.V., Stiebitz, M., Woodall, D.R. Ohba’s conjecture for graphs with independence number five. Discrete Math., 311: 996–1005 (2011)
Ohba, K. On chromatic-choosable graphs. J. of Graph Theory, 40: 130–135 (2002)
Ohba, K. Choice number of complete multigraphs with part size at most three. Ars combinatoria, 72: 133–139 (2004)
Reed, B., Sudakov, B. List colouring when the chromatic number is close to the order of the graph. Combinatorica, 25: 117–123 (2004)
Reed, B., Sudakov, B. List colourings of graphs with at most (2 - o(1)) vertices. Proceedings of International Congress of Methematices, Vol. 3, Higher Ed. Press, Beijing, 2002, 587–603
Shen, Y., He, W., Zheng, G., Li, Y. Ohba’s conjecture is ture for graphs with independence number at most three. Applied Mathematics Letters, 22: 938–942 (2009)
Shen, Y., He, W., Zheng, G., Wang, Y., Zhang, L. On choosability of some complete multipartite graphs and Ohba’s conjecture. Discrete Math., 308: 136–143 (2008)
Shen, Y., Zheng, G., He, W. Chromatic choosability of a class of complete multipartite graphs. J. of Mathematical Research and Exposition, 27: 264–272 (2007)
Tuza, Zs. Graph colorings with local constrains-A survey. Discussions Mathematicae Graph Theory, 17: 161–228 (1997)
Vizing, V.G. Coloring the vertices of a graph in prescribed colors. Diskret. Anal., 29: 3–10 (1976) (in Russian)
Woodall, D.R. List colourings of graphs. In: Surveys in combinatorics, ed. by J.W.P. Hirschfeld, London Math. Soc. Lecture Note Series, Vol. 288, Cambridge University Press, Cambridge, UK, 2001, 269–301
Zheng, G. Shen, Y. Chen, Z., Lv, J. On choosability of complete multipartite graphs K 4,3*t,2*(k-2t-2),1*(t+1). Discussiones Mathematicae Graph Theory, 30: 237–244 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 10871058), the project for mathematical research from the Natural Science Foundation of Hebei Province, China (No. 08M004), and Hebei Normal University of Science and Technology, China (ZDJS2009 and CXTD2012).
Rights and permissions
About this article
Cite this article
Shen, Yf., Wang, F., Zheng, Gp. et al. Ohba’s conjecture is true for graphs K t+2,3,2∗(k−t−2),1∗t . Acta Math. Appl. Sin. Engl. Ser. 31, 1083–1090 (2015). https://doi.org/10.1007/s10255-015-0531-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-015-0531-z