zbMATH — the first resource for mathematics

Edge weights and vertex colours. (English) Zbl 1042.05045
Summary: Can the edges of any non-trivial graph be assigned weights from \(\{1,2,3\}\) so that adjacent vertices have different sums of incident edge weights?
We give a positive answer when the graph is 3-colourable, or when a finite number of real weights is allowed.

05C15 Coloring of graphs and hypergraphs
Full Text: DOI
[1] P.N. Balister, E. Györi, J. Lehel, R.H. Schelp, Adjacent vertex distinguishing edge-colorings, to appear.
[2] Balister, P.N.; Riordan, O.M.; Schelp, R.H., Vertex-distinguishing edge colorings of graphs, J. graph theory, 42, 95-109, (2003) · Zbl 1008.05067
[3] Erdős, P.; Lovász, L., Problems and results on 3-chromatic hypergraphs and some related questions, (), 609-627
[4] Frieze, A.; Gould, R.J.; Karoński, M.; Pfender, F., On graph irregularity strength, J. graph theory, 41, 2, 120-137, (2002) · Zbl 1016.05045
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.