On a List Variant of the Multiplicative 1-2-3 Conjecture

The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with 1, 2, 3 so that no two adjacent vertices are incident to the same sum of labels. In the last decades, several aspects of this problem have been studied in literature, including more general versions and slight variations...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2022-06, Vol.38 (3), Article 88
Hauptverfasser:	Bensmail, Julien, Hocquard, Hervé, Lajou, Dimitri, Sopena, Éric
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Computer Science Discrete Mathematics Engineering Design Graph theory Graphs Labels Mathematics Mathematics and Statistics Original Paper Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!