Name
Abstract | ||
|---|---|---|
We consider the problem of coloring edges of a graph subject to the following constraints: for every vertex v, all the edges incident with v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraints and using the maximum number of colors. Notice that the notion of coloring is different than in the classical edge coloring problem, as neighboring edges can have the same color. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jda.2016.09.003 | Journal of Discrete Algorithms |
Keywords | Field | DocType |
Hardness of approximation,Approximation algorithms,Graph coloring | Complete coloring,Discrete mathematics,Edge coloring,Combinatorics,Fractional coloring,List coloring,Brooks' theorem,Vertex cover,Greedy coloring,Mathematics,Graph coloring | Conference |
Volume | ISSN | Citations |
38 | 1570-8667 | 3 |
PageRank | References | Authors |
0.43 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anna Adamaszek | 1 | 144 | 13.04 |
| Alexandru Popa | 2 | 70 | 13.34 |