Further Evidence Towards the Multiplicative 1-2-3 Conjecture - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles Discrete Applied Mathematics Year : 2022

Further Evidence Towards the Multiplicative 1-2-3 Conjecture

Abstract

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kaziów in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of labels. To date, this conjecture was mainly verified for complete graphs and 3-colourable graphs. As a strong support to the conjecture, it was also proved that all graphs admit such 4-labellings. In this work, we investigate how a recent proof of the multiset version of the 1-2-3 Conjecture by Vučković can be adapted to prove results on the product version. We prove that 4-chromatic graphs verify the product version of the 1-2-3 Conjecture. We also prove that for all graphs we can design 3-labellings that almost have the desired property. This leads to a new problem, that we solve for some graph classes.
Fichier principal
Vignette du fichier
product123.pdf (169.96 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02546401 , version 1 (17-04-2020)

Identifiers

Cite

Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Eric Sopena. Further Evidence Towards the Multiplicative 1-2-3 Conjecture. Discrete Applied Mathematics, 2022, 307, pp.135-144. ⟨10.1016/j.dam.2021.10.014⟩. ⟨hal-02546401⟩
177 View
122 Download

Altmetric

Share

More