Name
Title | ||
|---|---|---|
Arbitrarily large difference between dd-strong chromatic index and its trivial lower bound. |
Abstract | ||
|---|---|---|
Let φ:E→{1,2,…,k} be a proper edge coloring of a graph G=(V,E). The set of colors of edges incident to a vertex v∈V is called the color set of v and denoted by S(v). The coloring φ is vertex-distinguishing if S(u)≠S(v) for any two distinct vertices u,v∈V. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.disc.2013.01.026 | Discrete Mathematics |
Keywords | Field | DocType |
Vertex-distinguishing coloring,d-strong chromatic index,Circulant graph | Discrete mathematics,Complete coloring,Edge coloring,Combinatorics,Bound graph,Graph power,Fractional coloring,List coloring,Brooks' theorem,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
313 | 19 | 0012-365X |
Citations | PageRank | References |
2 | 0.41 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martina Mockovciaková | 1 | 19 | 5.04 |
| Roman Soták | 2 | 128 | 24.06 |