A. Beutelspacher and P. Hering, Minimal graphs for which the chromatic number equals the maximal degree, Ars Combin, vol.18, pp.201-216, 1984.

O. V. Borodin and A. V. Kostochka, On an upper bound of a graph's chromatic number, depending on the graph's degree and density, Journal of Combinatorial Theory, Series B, vol.23, issue.2-3, pp.247-250, 1977.
DOI : 10.1016/0095-8956(77)90037-5

R. L. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil. Soc, pp.194-197, 1941.

R. G. Downey and M. R. Fellows, Parameterized Complexity. Monographs in Computer Science, 1999.

T. Emden-weinert, S. Hougardy, and B. Kreuter, Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth, Combinatorics, Probability and Computing, vol.7, issue.4, pp.375-386, 1998.
DOI : 10.1017/S0963548398003678

B. Farzad, M. Molloy, and B. Reed, <mml:math altimg="si1.gif" 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:mo stretchy="false">(</mml:mo><mml:mi>??</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-critical graphs, Journal of Combinatorial Theory, Series B, vol.93, issue.2, pp.173-185, 2005.
DOI : 10.1016/j.jctb.2004.09.006

M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, p.237267, 1976.
DOI : 10.1016/0304-3975(76)90059-1

I. Holyer, The NP-Completeness of Edge-Coloring, SIAM Journal on Computing, vol.10, issue.4, pp.225-231, 1981.
DOI : 10.1137/0210055

J. E. Hopcroft and R. M. , An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

T. R. Jensen and B. Toft, Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1995.

M. Molloy and B. Reed, Colouring graphs when the number of colours is nearly the maximum degree, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, pp.462-470, 2001.
DOI : 10.1145/380752.380840

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

B. Reed, A Strengthening of Brooks' Theorem, Journal of Combinatorial Theory, Series B, vol.76, issue.2, pp.136-149, 1999.
DOI : 10.1006/jctb.1998.1891

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