Journal article icon

Journal article

Vertex-Colouring Edge-Weightings.

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 Σ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 vertex-colouring of G, for every edge (u,v) of G, cu≠cv . © 2007 Springer-Verlag Berlin Heidelberg.
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1007/s00493-007-0041-6

Authors


Journal:
Combinatorica
Volume:
27
Issue:
1
Pages:
1-12
Publication date:
2007-01-01
DOI:
EISSN:
1439-6912
ISSN:
0209-9683
URN:
uuid:48471217-845b-4884-afce-4d954cf86bc4
Source identifiers:
102288
Local pid:
pubs:102288
Language:
English
Keywords:

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP