Name
Abstract | ||
|---|---|---|
We prove the conjecture of Burris and Schelp: a coloring of the edges of a graph of order n such that a vertex is not incident with two edges of the same color and any two vertices are incident with different sets of colors is possible using at most n +1 colors. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/jctb.1998.1884 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
vertex-distinguishing proper edge-colorings,difference set,edge coloring | Complete coloring,Discrete mathematics,Edge coloring,Combinatorics,Fractional coloring,Vertex (geometry),Vertex (graph theory),Cycle graph,Greedy coloring,Multiple edges,Mathematics | Journal |
Volume | Issue | ISSN |
75 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
34 | 7.65 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristina Bazgan | 1 | 679 | 62.76 |
| Amel Harkat-Benhamdine | 2 | 56 | 10.40 |
| Hao Li | 3 | 55 | 10.77 |
| Mariusz Woźniak | 4 | 204 | 34.54 |