International Journal of Applied Mathematics and Machine Learning[1] L. Addario-Berry, K. Dalal, C. McDiarmid, B. A. Reed and A.
Thomason, Vertex-colouring edge-wheitings, Combinatorical J. 27
(2007), 1-12.
[2] L. Addario-Berry, K. Dalal and B. A. Reed, Degree constrained
subgraphs, Discrete Applied Mathematics J. 156 (2008), 1168-1174.
[3] M. R. Farahani, On the 1-2-3-edge weighting and vertex coloring of
complete graph, Int. J. Computational Sciences & Applications 3(3)
(2013), 19-23. DOI:10.5121/ijcsa.2013.3302.
[4] M. R. Farahani, Vertax-coloring and edge-weighting of complete
graphs, J. Appl. Math. & Informatics 32(1-2) (2014), 1-6.
http://dx.doi.org/10.14317/jami.2014.001
[5] M. R. Farahani and S. H. Hosseini, The 1-2-3-edge labeling and
vertex coloring of complete graphs, Algebras, Groups and Geometries
31(2) (2014), 183.
[6] J. Grytczuka, K. Dalal and B. A. Reed, Thue type problems for
graphs, Discrete Mathematics J. 308 (2008), 4419-4429.
[7] Kalkowski and M. Kalkowski, A note on the 1, 2-conjecture,
submitted for publication.
[8] M. Kalkowski, M. Karonski and F. Pfender, Vertex-Coloring
Edge-Weightings with Integer Weights at Most 6, Publisher online
(2003), 101-119.
[9] M. Kalkowski, M. Karonski and F. Pfender, Vertex-coloring
edge-weightings: Towards the1-2-3-conjecture, Combinatorial Theory
Series B J. 100 (2010), 347-349.
[10] M. Karonski, T. Luczak and A. Thomason, Edge weights and vertex
colours, Combinatorial Theory (Series B) J. 91 (2004), 151-157.
[11] T. Wang and Q. Yu, On vertex-coloring 13-edge-weighting, Front.
Math. China 3 (2008), 1-7.
