Title of article
Edge weights and vertex colours
Author/Authors
Karo?ski، نويسنده , , Micha? and ?uczak، نويسنده , , Tomasz and Thomason، نويسنده , , Andrew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
7
From page
151
To page
157
Abstract
Can the edges of any non-trivial graph be assigned weights from {1,2,3} so that adjacent vertices have different sums of incident edge weights?
e a positive answer when the graph is 3-colourable, or when a finite number of real weights is allowed.
Keywords
Edge weighting , Vertex colouring
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2004
Journal title
Journal of Combinatorial Theory Series B
Record number
1527434
Link To Document