A note on approximating theb-chromatic number

Blidia, 2009, On b-colorings in regular graphs, Discrete Applied Mathematics, 157, 1787, 10.1016/j.dam.2009.01.007 Bonomo, 2009, On the b-coloring of cographs and P4-sparse graphs, Graphs and Combinatorics, 25, 153, 10.1007/s00373-008-0829-1 Campos, 2009, b-chromatic number of cacti, Electronic Notes in Discrete Mathematics, 35, 281, 10.1016/j.endm.2009.11.046 Corteel, 2005, On approximating the b-chromatic number, Discrete Applied Mathematics, 146, 106, 10.1016/j.dam.2004.09.006 Hajiabolhassan, 2010, On the b-chromatic number of Kneser graphs, Discrete Applied Mathematics, 158, 232, 10.1016/j.dam.2009.09.023 Håstad, 1999, Clique is hard to approximate within n(1−ϵ), Acta Mathematica, 182, 105, 10.1007/BF02392825 Irving, 1999, The b-chromatic number of a graph, Discrete Applied Mathematics, 91, 127, 10.1016/S0166-218X(98)00146-2 Jakovac, 2010, The b-chromatic number of cubic graphs, Graphs and Combinatorics, 26, 107, 10.1007/s00373-010-0898-9 Kratochvíl, 2002, On the b-chromatic number of graphs, 310 Sales, 2009, b-coloring of m-tight graphs, Electronic Notes in Discrete Mathematics, 35, 209, 10.1016/j.endm.2009.11.035 Zuckerman, 2007, Linear degree extractors and the inapproximability of max clique and chromatic number, Theory of Computing, 3, 103, 10.4086/toc.2007.v003a006