B. Baker and E. Coffman, Mutual exclusion scheduling, Theoretical Computer Science, vol.162, pp.225-243, 1996.

C. Bentz and C. Picouleau, Locally bounded k-colorings of trees, RAIRO-RO, vol.43, pp.27-34, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01125556

H. L. Bodlaender and F. V. Fomin, Equitable colorings of bounded treewidth graphs, Theoretical Computer Science, vol.349, pp.22-30, 2005.

H. L. Bodlaender and K. Jansen, Restrictions of graph partition problems: Part I, Theoretical Computer Science, vol.148, pp.93-109, 1995.

F. Bonomo, S. Mattia, and G. Oriolo, Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, Theoretical Computer Science, vol.412, pp.6261-6268, 2011.

A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol.2, 1999.

M. Dror, G. Finke, S. Gravier, and W. Kubiak, On the complexity of a restricted list-coloring problem, Discrete Mathematics, vol.195, pp.103-109, 1999.

J. Fiala, P. A. Golovach, and J. Kratochvil, Parameterized complexity of coloring problems: Treewidth versus vertex cover, Theoretical Computer Science, vol.412, pp.2513-2523, 2011.

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979.

S. Gravier, D. Kobler, and W. Kubiak, Complexity of list coloring problems with a fixed total number of colors, Discrete Applied Mathematics, vol.117, pp.65-79, 2002.

P. Hansen, A. Hertz, and J. Kuplinsky, Bounded vertex colorings of graphs, Discrete Mathematics, vol.111, pp.305-312, 1993.

I. Holyer, The NP-Completeness of Edge-Colouring, SIAM Journal on Computing, vol.10, pp.718-720, 1981.

K. Jansen, S. Kratsch, D. Marx, and I. Schlotter, Bin packing with fixed number of bins revisited, Journal of Computer and System Sciences, vol.79, pp.39-49, 2013.

K. Jansen and P. Scheffler, Generalized coloring for tree-like graphs, Discrete Applied Mathematics, vol.75, pp.135-155, 1997.

T. Kloks, Treewidth: Computations and Approximations, Lecture Notes in Computer Science, vol.842, 1994.