[1] M. Aigner, E. Triesch: Irregular assignments and two problems á la Ringel. Topics in Combinatorics and Graph Theory. (R. Bodendiek and R. Henn, eds.). Physica, Heidelberg (1990), 29–36. MR 1100017

[2] M. Aigner, E. Triesch, Z. Tuza: Irregular assignments and vertex-distinguishing edge-colorings of graphs. Combinatorics ’90, Proc. Conf., Gaeta/Italy 1990, Elsevier Science Pub., New York (1992), 1–9. MR 1195794

[3] A. C. Burris: On graphs with irregular coloring number $2$. Congr. Numerantium 100 (1994), 129–140. MR 1382313 | Zbl 0836.05029

[4] A. C. Burris: The irregular coloring number of a tree. Discrete Math. 141 (1995), 279–283. MR 1336691 | Zbl 0829.05027

[5] G. Chartrand, H. Escuadro, F. Okamoto, P. Zhang: Detectable colorings of graphs. (to appear). MR 2212794

[6] G. Chartrand, P. Zhang: Introduction to Graph Theory. McGraw-Hill, Boston, 2005.