THE 1-2-3-EDGE LABELLING AND VERTEX COLOURS
International Journal of Applied Mathematics and Machine Learning · 2016
A labelling of the edges of a graph is called vertex-colouring if the labelled degrees of the vertices yield a proper colouring of the graph.In this paper, we show that such a labelling is possible from the label with numbers of the set { } 3 , 2 , 1 for all graphs not containing components with exactly 2 vertices.