Name
Abstract | ||
|---|---|---|
If f is a proper coloring of edges in a graph G=(V,E), then for each vertex v∈V it defines the palette of colors of v, i.e., the set of colors of edges incident with v. In 1997, Burris and Schelp stated the following problem: how many colors do we have to use if we want to distinguish all vertices by their palettes. In general, we may need much more colors than χ′(G). |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.ejc.2014.02.008 | European Journal of Combinatorics |
Field | DocType | Volume |
Edge coloring,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Fractional coloring,Mathematics | Journal | 40 |
ISSN | Citations | PageRank |
0195-6698 | 3 | 0.56 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |
| Monika Pilsniak | 2 | 29 | 5.42 |
| Jakub Przybyło | 3 | 210 | 27.55 |
| Mariusz Wozniak | 4 | 111 | 19.51 |