Title of article
A new type of edge-derived vertex coloring
Author/Authors
I. Gyori، نويسنده , , Ervin and Palmer، نويسنده , , Cory، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
9
From page
6344
To page
6352
Abstract
We study the minimum number of weights assigned to the edges of a graph G with no component K 2 so that any two adjacent vertices have distinct sets of weights on their incident edges. The best possible upper bound on this parameter is proved.
Keywords
Edge-weighting , chromatic number , Edge coloring
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1599188
Link To Document