R. Balakrishnan and S. F. Raj, Bounds for the -chromatic number of, Discrete Applied Mathematics, vol.161, issue.9, pp.1173-1179, 2013.
DOI : 10.1016/j.dam.2011.08.022

D. Barth, J. Cohen, and T. Faik, On the b-continuity property of graphs, Discrete Applied Mathematics, vol.155, issue.13, pp.1761-1768, 2007.
DOI : 10.1016/j.dam.2007.04.011
URL : https://hal.archives-ouvertes.fr/hal-00126001

M. Blidia, N. I. Eschouf, and F. Maffray, b-coloring of some bipartite graphs, Australasian Journal of Combinatorics, vol.53, pp.67-76, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00764253

M. Blidia, N. I. Eschouf, and F. Maffray, On vertex b-critical trees, Opuscula Mathematica, vol.33, issue.1, pp.19-28, 2013.
DOI : 10.7494/OpMath.2013.33.1.19
URL : https://hal.archives-ouvertes.fr/hal-00787629

M. Blidia, N. I. Eschouf, and F. Maffray, On edge b-critical graphs, Discrete Applied Mathematics, vol.180, pp.176-180, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01212153

S. Cabello and M. Jakovac, On the b-chromatic number of regular graphs, Discrete Applied Mathematics, vol.159, issue.13, pp.1303-1310, 2011.
DOI : 10.1016/j.dam.2011.04.028

V. Campos, C. Lima, and A. Silva, Graphs of girth at least 7 have high b-chromatic number, European Journal of Combinatorics, vol.48, pp.154-164, 2015.
DOI : 10.1016/j.ejc.2015.02.017

B. Effantin and H. Kheddouci, The b-chromatic number of some power graphs, Discrete Mathematics and Theoretical Computer Science, vol.6, pp.45-54, 2003.

N. I. Eschouf, Characterization of some b-chromatic edge critical graphs, Australasian Journal of Combinatorics, vol.47, pp.21-35, 2010.

P. M. Grundy, Mathematics and games, pp.6-8, 1939.

A. Gyárfás, Z. Király, and J. Lehel, On-line 3-chromatic graphs - II critical graphs, Discrete Mathematics, vol.177, issue.1-3, pp.99-122, 1997.
DOI : 10.1016/S0012-365X(96)00359-7

F. Havet, C. L. Sales, and L. Sampaio, <mml:math altimg="si5.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>b</mml:mi></mml:math>-coloring of tight graphs, Discrete Applied Mathematics, vol.160, issue.18, pp.2709-2715, 2012.
DOI : 10.1016/j.dam.2011.10.017

C. T. Hoàng and M. Kouider, On the b-dominating coloring of graphs, Discrete Applied Mathematics, vol.152, issue.1-3, pp.4399-4408, 2005.
DOI : 10.1016/j.dam.2005.04.001

C. T. Hoàng, F. Maffray, and M. Mechebbek, A Characterization of b-Perfect Graphs, Journal of Graph Theory, vol.16, issue.2, pp.95-122, 2012.
DOI : 10.1002/jgt.20635

C. T. Hoàng, C. L. Sales, and F. Maffray, On minimally b-imperfect graphs, Discrete Applied Mathematics, vol.157, issue.17, pp.3519-3530, 2009.
DOI : 10.1016/j.dam.2009.02.023

R. W. Irving and D. F. Manlove, The b-chromatic number of a graph, Discrete Applied Mathematics, vol.91, issue.1-3, pp.127-141, 1999.
DOI : 10.1016/S0166-218X(98)00146-2

M. Jakovac and S. Klav?ar, The b-Chromatic Number of Cubic Graphs, Graphs and Combinatorics, vol.306, issue.1, pp.107-118, 2010.
DOI : 10.1007/s00373-010-0898-9

J. Kratochvil, Z. Tuza, and M. Voigt, On the b-chromatic number of graphs. Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.310-320, 2002.

F. Maffray and A. Silva, b-colouring the Cartesian product of trees and some other graphs, Discrete Applied Mathematics, vol.161, issue.4-5, pp.650-669, 2013.
DOI : 10.1016/j.dam.2011.06.019
URL : https://hal.archives-ouvertes.fr/hal-00977577

A. E. Sahili and M. Kouidder, b-chromatic number of regular graphs, Utilitas Mathematica, vol.80, pp.211-216, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01301071

L. Sampaio, Algorithmic aspects of graph colouring heuristics, 2012.

S. Shaebani, On the <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>b</mml:mi></mml:math>-chromatic number of regular graphs without 4-cycle, Discrete Applied Mathematics, vol.160, issue.10-11, pp.1610-1614, 2012.
DOI : 10.1016/j.dam.2012.02.001

M. Zaker, Results on the Grundy chromatic number of graphs, Discrete Mathematics, vol.306, issue.23, pp.3166-3173, 2006.
DOI : 10.1016/j.disc.2005.06.044

M. Zamime, M. Kouider, and H. A. Haddadène, On the b-coloring of G? e, European Journal of Combinatorics, 2015.