On the role of 3s for the 1-2-3 Conjecture

The 1-2-3 Conjecture states that every connected graph different from K2 admits a proper 3-(edge-)labelling, i.e., can have its edges labelled with 1,2,3 so that no two adjacent vertices are incident to the same sum of labels. In connection with some recent optimisation variants of this conjecture,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2021-11, Vol.892, p.238-257
Hauptverfasser:	Bensmail, Julien, Fioravantes, Foivos, Mc Inerney, Fionn
Format:	Artikel
Sprache:	eng
Schlagworte:	1-2-3 Conjecture 3-chromatic graphs Computer Science Discrete Mathematics Proper labellings
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!