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

O. Baudon, J. Bensmail, J. Przyby?o, and M. Wo´zniakwo´zniak, On decomposing regular graphs into locally irregular subgraphs, European Journal of Combinatorics, vol.49, pp.90-104, 2015.
DOI : 10.1016/j.ejc.2015.02.031

O. Baudon, J. Bensmail, and . Sopena, On the complexity of determining the irregular chromatic index of a graph, Journal of Discrete Algorithms, vol.30, pp.113-127, 2015.
DOI : 10.1016/j.jda.2014.12.008
URL : https://hal.archives-ouvertes.fr/hal-00921849

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

W. Schnyder, Embedding planar graphs on the grid, Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pp.138-148, 1990.

V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz, vol.3, pp.25-30, 1964.