On irregular total labellings

Amar, 1998, Irregularity strength of trees, Discrete Math., 190, 15, 10.1016/S0012-365X(98)00112-5

Chartrand, 1988, Irregular networks, Congr. Numer., 64, 187

Dimitz, 1992, On the irregularity strength of the m×n grid, J. Graph Theory, 16, 355, 10.1002/jgt.3190160409

Faudree, 1988, Irregular networks, regular graphs and integer matrices with distinct row and column sums, Discrete Math., 76, 223, 10.1016/0012-365X(89)90321-X

R.J. Faudree, J. Lehel, Bounds on the irregularity strength of regular graphs, in: Combinatorics (Eger, (1987)) Colloquia Mathematica Societatis János Bobyai, vol. 52, North-Holland, Amsterdam, 1988, pp. 247–256.

Gallian, 1998, Graph labeling, Electron. J. Combin., 5

M.S. Jacobson, J. Lehel, Degree irregularity, available online at 〈http://athena.louisville.edu/msjaco01/irregbib.html〉.

Jendrol’, 1996, The irregularity strength and cost of the union of cliques, Discrete Math., 150, 179, 10.1016/0012-365X(95)00186-Z

J. Lehel, Facts and quests on degree irregular assignment, Graph Theory, Combin. Appl., Wiley, New York, 1991, pp. 765–782.

Nierhoff, 2000, A tight bound on the irregularity strength of graphs, SIAM J. Discrete Math., 13, 313, 10.1137/S0895480196314291

Wallis, 2001

D.R. Wood, On pseudo vertex-magic and edge-magic total labelings, in: E.T. Baskoro (Ed.), Proceedings of the Twelfth Australasian Workshop on Combinatorial Algorithms, ITB Bandung, July 14–17, 2001, pp. 180–198.