Name
Abstract | ||
|---|---|---|
A proper edge-coloring of a graph defines at each vertex the set of colors of its incident edges. This set is called the palette of the vertex. In this paper we are interested in the minimum number of palettes taken over all possible proper colorings of a graph. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s00373-013-1298-8 | Graphs and Combinatorics |
Keywords | DocType | Volume |
possible proper colorings,edge colorings,minimum number,incident edge,proper edge-coloring | Journal | 30 |
Issue | ISSN | Citations |
3 | 1435-5914 | 3 |
PageRank | References | Authors |
0.47 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mirko Horňák | 1 | 127 | 16.28 |
| Rafał Kalinowski | 2 | 48 | 10.75 |
| Mariusz Meszka | 3 | 30 | 16.21 |
| Mariusz Woźniak | 4 | 204 | 34.54 |