Name
Title | ||
|---|---|---|
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree |
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0012-365X(00)00428-3 | Discrete Mathematics |
Keywords | Field | DocType |
vertex-distinguishing coloring,large minimum degree,vertex-distinguishing proper coloring,edge coloring,difference set | Discrete mathematics,Edge coloring,Complete coloring,Combinatorics,Fractional coloring,List coloring,Degree (graph theory),Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
236 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
9 | 0.89 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristina Bazgan | 1 | 679 | 62.76 |
| Amel Harkat-Benhamdine | 2 | 56 | 10.40 |
| Hao Li | 3 | 9 | 0.89 |
| Mariusz Woźniak | 4 | 204 | 34.54 |