On a graph labelling conjecture involving coloured labels - Archive ouverte HAL Access content directly
Journal Articles Discussiones Mathematicae Graph Theory Year : 2024

On a graph labelling conjecture involving coloured labels

Abstract

In this work, we investigate a recent conjecture by Baudon, Bensmail, Davot, Hocquard, Przybyło, Senhaji, Sopena and Woźniak, which states that graphs, in general, can be edge-labelled with red labels 1,2 and blue labels 1,2 so that every two adjacent vertices are distinguished accordingly to either the sums of their incident red labels or the sums of their incident blue labels. To date, this was verified for several classes of graphs. Also, it is known how to design several labelling schemes that are very close to what is desired. In this work, we adapt two important proofs of the field, leading to some progress towards that conjecture. We first prove that graphs can be labelled with red labels 1,2,3 and blue labels 1,2 so that every two adjacent vertices are distinguished as required. We then verify the conjecture for graphs with chromatic number at most 4.
Fichier principal
Vignette du fichier
22weak.pdf (284.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02554102 , version 1 (24-04-2020)
hal-02554102 , version 2 (14-11-2021)

Identifiers

Cite

Julien Bensmail. On a graph labelling conjecture involving coloured labels. Discussiones Mathematicae Graph Theory, 2024, 44 (1), pp.231-244. ⟨10.7151/dmgt.2441⟩. ⟨hal-02554102v2⟩
144 View
197 Download

Altmetric

Share

Gmail Facebook X LinkedIn More