Title of article
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Author/Authors
Edgar Kalkowski، نويسنده , , Maciej and Karo?ski، نويسنده , , Micha? and Pfender، نويسنده , , Florian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
3
From page
347
To page
349
Abstract
A weighting of the edges of a graph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such a weighting is possible from the weight set { 1 , 2 , 3 , 4 , 5 } for all graphs not containing components with exactly 2 vertices.
Keywords
Irregular graph labellings
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2010
Journal title
Journal of Combinatorial Theory Series B
Record number
1528046
Link To Document