Name
Abstract | ||
|---|---|---|
It is proved that edges of a graph G with no component K\"2 can be coloured using at most 2@?log\"2@g(G)@?+1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.07.046 | Discrete Mathematics |
Keywords | Field | DocType |
edge colouring,general neighbour-distinguishing index,colour set,indexation,index | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Semi-symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 5-6 | Discrete Mathematics |
Citations | PageRank | References |
9 | 0.70 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ervin Győri | 1 | 65 | 7.92 |
| Mirko Horňák | 2 | 127 | 16.28 |
| Cory Palmer | 3 | 44 | 10.33 |
| Mariusz Woźniak | 4 | 204 | 34.54 |