L. Addario-berry, R. E. Aldred, K. Dalal, and B. A. Reed, Vertex colouring edge partitions, Vertex colouring edge partitions, pp.237-244, 2005.
DOI : 10.1016/j.jctb.2005.01.001
URL : http://doi.org/10.1016/j.jctb.2005.01.001

R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, 2000.

A. Davoodi and B. Omoomi, On the 1-2-3-conjecture
URL : https://hal.archives-ouvertes.fr/hal-01196861

A. Dudek and D. Wajc, On the complexity of vertex-colouring edge-weightings, pp.45-50, 2011.

H. Escuadro, F. Okamoto, and P. Zhang, Vertex-distinguishing colorings of graphs: A survey of recent developments, AKCE J. Graphs. Combin, vol.4, issue.3, pp.277-299, 2007.

H. Escuadro, F. Okamoto, and P. Zhang, A three-color problem in graph theory, Bulletin of the ICA, vol.52, pp.65-82, 2008.

M. Karo´nskikaro´nski, T. Luczak, 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. Meringer, Fast generation of regular graphs and construction of cages, Journal of Graph Theory, vol.9, issue.2, pp.137-146, 1999.
DOI : 10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, 1978.
DOI : 10.1145/800133.804350