L. Addario-berry, K. Dalal, and B. A. Reed, Degree constrained subgraphs, Proceedings of GRACO2005, pp.257-263, 2005.
DOI : 10.1016/j.endm.2005.05.035

M. Anholcer, M. Kalkowski, and J. Przyby?o, A new upper bound for the total vertex irregularity strength of graphs, Discrete Math, pp.6316-6317, 2009.

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
DOI : 10.1137/090774112

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
DOI : 10.1016/j.jctb.2009.06.002

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

J. Przyby?o, A note on a neighbour-distinguishing regular graphs total-weighting, Electron, J. Combin, vol.15, issue.1, p.35, 2008.

J. Przyby?o, Irregularity strength of regular graphs, Electron, J. Combin, vol.15, issue.1, p.82, 2008.

J. Przyby?o, Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs, SIAM Journal on Discrete Mathematics, vol.23, issue.1, pp.511-516, 2009.
DOI : 10.1137/070707385

J. Przyby?o and M. Wo´zniakwo´zniak, Total weight choosability of graphs

T. Wong, D. Yang, and X. Zhu, Total weighting of graphs by max-min method

T. Wong and X. Zhu, Total weight choosability of graphs, Journal of Graph Theory, vol.3, issue.3
DOI : 10.1002/jgt.20500