Vertex-Colouring Edge-Weightings.

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 Σe∋vw(e). We show that the edges of every graph that does not contain a component isomorphic to K 2 can be weighted from the set {1, . . . ,30} such that in the resulting ve...

Descrición completa

Detalles Bibliográficos
Main Authors: Addario-Berry, L, Dalal, K, McDiarmid, C, Reed, B, Thomason, A
Formato: Journal article
Idioma:English
Publicado: 2007