L. Addario-berry, R. E. Aldred, K. Dalal, and B. A. Reed, Vertex colouring edge partitions, Journal of Combinatorial Theory, Series B, vol.94, issue.2, pp.237-244, 2005.
DOI : 10.1016/j.jctb.2005.01.001

L. Addario-berry, K. Dalal, and B. A. Reed, Degree constrained subgraphs, Discrete Applied Mathematics, vol.156, issue.7, pp.1168-1174, 2008.
DOI : 10.1016/j.dam.2007.05.059

M. Aigner, E. Triesch, and Z. Tuza, Irregular assignments and vertex-distinguishing edge-colorings of graphs, Combinatorics '90 (Gaeta, pp.1-9, 1990.
DOI : 10.1016/S0167-5060(08)70896-3

T. Bartnicki, J. Grytczuk, and S. Niwczyk, Weight choosability of graphs, Journal of Graph Theory, vol.85, issue.2, pp.242-256, 2009.
DOI : 10.1002/jgt.20354

A. C. Burris and R. H. Schelp, Vertex-distinguishing proper edge-colorings, Journal of Graph Theory, vol.26, issue.2, pp.73-82, 1997.
DOI : 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C

G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz et al., Irregular networks, Congr. Numer, vol.64, pp.197-210, 1986.

P. Erd?-os and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and finite sets, pp.609-627, 1973.

E. Gy?-ori and C. Palmer, A new type of edge-derived vertex coloring, Discrete Mathematics, vol.309, issue.22, pp.6344-6352, 2009.
DOI : 10.1016/j.disc.2008.11.014

M. Kalkowski, A note on the 1,2-conjecture. Preprint, private communication, 2009.

M. Kalkowski, M. Karo´nskikaro´nski, and F. Pfender, Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.3, pp.347-349, 2010.
DOI : 10.1016/j.jctb.2009.06.002

M. Kalkowski, M. Karo´nskikaro´nski, and F. Pfender, A New Upper Bound for the Irregularity Strength of Graphs, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1319-1321, 2011.
DOI : 10.1137/090774112

M. Karo´nskikaro´nski, T. ?uczak, and A. Thomason, Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.151-157, 2004.
DOI : 10.1016/j.jctb.2003.12.001

M. Khatirinejad, R. Naserasr, M. Newman, B. Seamone, and B. Stevens, Digraphs are 2-weight choosable, ):Paper 21, 2011.

J. Przyby?o and M. Wo´zniakwo´zniak, On a 1,2 conjecture, Discrete Math. Theor. Comput. Sci, vol.12, issue.1, pp.101-108, 2010.

B. Seamone, On weight choosability and additive choosability numbers of graphs, submitted

B. Seamone, Derived Colourings of Graphs, 2012.

J. Skowronek-kaziów, 1,2 conjecture -the multiplicative version, Inform. Process. Lett, vol.107, pp.3-493, 2008.

J. Spencer, Asymptotic lower bounds for Ramsey functions, Discrete Mathematics, vol.20, issue.1, pp.69-7678, 1977.
DOI : 10.1016/0012-365X(77)90044-9