C. Berge, TWO THEOREMS IN GRAPH THEORY, Proceedings of the National Academy of Sciences, vol.43, issue.9, pp.842-844, 1957.
DOI : 10.1073/pnas.43.9.842

H. L. Bodlaender, Achromatic number is NP-complete for cographs and interval graphs, Information Processing Letters, vol.31, issue.3, pp.135-138, 1989.
DOI : 10.1016/0020-0190(89)90221-4

F. Bonomo, G. Durán, F. Maffray, J. Marenco, and M. Valencia-pabon, On the b-Coloring of Cographs and P 4-Sparse Graphs, Graphs and Combinatorics, vol.25, issue.2, pp.153-167, 2009.
DOI : 10.1007/s00373-008-0829-1
URL : https://hal.archives-ouvertes.fr/hal-00477747

G. B. Dantzig, Discrete-Variable Extremum Problems, Operations Research, vol.5, issue.2, pp.266-277, 1957.
DOI : 10.1287/opre.5.2.266

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

T. Faik, La b-continuité des b-colorations : complexité, propriétés structurelles et algorithmes, L.R.I, 2005.

F. Harary and S. Hedetniemi, The achromatic number of a graph, Journal of Combinatorial Theory, vol.8, issue.2, pp.154-161, 1970.
DOI : 10.1016/S0021-9800(70)80072-2

F. Havet and C. , <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. Hò-ang and M. Kouider, On the b-dominating coloring of graphs, Discrete Applied Mathematics, vol.152, issue.1-3, pp.176-186, 2005.
DOI : 10.1016/j.dam.2005.04.001

C. T. Hò-ang, 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

J. Kratochvíl, . Zs, M. Tuza, and . Voigt, On the b-Chromatic Number of Graphs, Lecture Notes in Computer Science, vol.2573, pp.310-320, 2002.
DOI : 10.1007/3-540-36379-3_27

G. Tinhofer, Strong tree-cographs are birkhoff graphs, Discrete Applied Mathematics, vol.22, issue.3, pp.275-288, 1989.
DOI : 10.1016/0166-218X(88)90100-X
URL : http://doi.org/10.1016/0166-218x(88)90100-x

M. Yannakakis and F. Gavril, Edge Dominating Sets in Graphs, SIAM Journal on Applied Mathematics, vol.38, issue.3, pp.364-372, 1980.
DOI : 10.1137/0138030