Name
Abstract | ||
|---|---|---|
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is $${\sum\nolimits_{e \mathrel\backepsilon v} {w{\left( e \right)}} }$$. We show that the edges of every graph that does not contain a component isomorphic to K2 can be weighted from the set {1, . . . ,30} such that in the resulting vertex-colouring of G, for every edge (u,v) of G, cu ≠cv. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00493-007-0041-6 | Combinatorica |
Keywords | Field | DocType |
vertex-colouring edge-weightings,component isomorphic,backepsilon v,weighting w,denoted cv,graph g,resulting vertex-colouring,vertex v | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Isomorphism,New digraph reconstruction conjecture,Mathematics | Journal |
Volume | Issue | Citations |
27 | 1 | 28 |
PageRank | References | Authors |
6.82 | 4 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Louigi Addario-Berry | 1 | 127 | 22.22 |
| Ketan Dalal | 2 | 107 | 10.37 |
| Colin McDiarmid | 3 | 1071 | 167.05 |
| Bruce A. Reed | 4 | 1311 | 122.69 |
| Andrew Thomason | 5 | 71 | 16.01 |