J. Araujo, L. Sales, C. , S. , and I. , Weighted coloring on p 4 -sparse graphs, 11es Journées Doctorales en Informatique et Réseaux, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00467853

D. De-werra, M. Demange, B. Escoffier, J. Monnot, P. et al., Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation, Lecture Notes in Computer Science, vol.3341, pp.896-907, 2005.
DOI : 10.1007/978-3-540-30551-4_76
URL : https://hal.archives-ouvertes.fr/hal-00004074

M. Demange, D. De-werra, J. Monnot, P. , and V. T. , Weighted Node Coloring: When Stable Sets Are Expensive, Lecture Notes in Computer Science, vol.2573, pp.114-125, 2002.
DOI : 10.1007/3-540-36379-3_11

B. Escoffier, J. Monnot, P. , and V. T. , Weighted Coloring: further complexity and approximability results, Information Processing Letters, vol.97, issue.3, pp.98-103, 2006.
DOI : 10.1016/j.ipl.2005.09.013
URL : https://hal.archives-ouvertes.fr/hal-00116712

S. Gravier, A hajós-like theorem for list coloring. Discrete Math, pp.299-302, 1996.

D. Guan and X. Zhu, A coloring problem for weighted graphs, Information Processing Letters, vol.61, issue.2, pp.77-81, 1997.
DOI : 10.1016/S0020-0190(97)00002-1

G. Hajós, ¨ Uber eine konstruktion nicht n-färbbarer graphen, Wiss. Z. Martin Luther Univ. Math.-Natur.Reihe, vol.10, pp.116-117, 1961.

D. Hanson, G. C. Robinson, and B. Toft, Remarks on the graph colour theorem of hajós, Cong. Numer, vol.55, pp.69-76, 1986.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations Plenum, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

D. Kral, Haj??s' theorem for list coloring, Discrete Mathematics, vol.287, issue.1-3, pp.161-163, 2004.
DOI : 10.1016/j.disc.2004.07.001

A. Mansfield, W. , and D. , Some Colouring Problems and their Complexity, Graph Theory, Proceedings of the Conference on Graph Theory, B. Bollobás of North-Holland Mathematics Studies, pp.159-170, 1982.
DOI : 10.1016/S0304-0208(08)73557-6

B. Mohar, Haj???s Theorem For Colorings Of Edge-Weighted Graphs, COMBINATORICA, vol.25, issue.1, pp.65-76, 2005.
DOI : 10.1007/s00493-005-0005-7

O. Ore, The four color problem, 1967.

A. Urquhart, The graph constructions of Haj??s and Ore, Journal of Graph Theory, vol.26, issue.4, pp.211-215, 1997.
DOI : 10.1002/(SICI)1097-0118(199712)26:4<211::AID-JGT5>3.3.CO;2-6

X. Zhu, An Analogue of Haj???s' Theorem for the Circular Chromatic Number (II), Graphs and Combinatorics, vol.19, issue.3, pp.419-432, 2003.
DOI : 10.1007/s00373-002-0505-9