Title of article
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree Original Research Article
Author/Authors
Cristina Bazgan، نويسنده , , Amel Harkat-Benhamdine، نويسنده , , Hao Li، نويسنده , , Mariusz Wo?niak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
6
From page
37
To page
42
Abstract
We prove that the number of colors required to properly color the edges of a graph of order n and δ(G)>n/3 in such a way that any two vertices are incident with different sets of colors is at most Δ(G)+5.
Keywords
Edge coloring , Vertex-distinguishing coloring
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949725
Link To Document