The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures

Abstract

The Weak $(2,2)$-Conjecture is a graph labelling problem asking whether all connected graphs of at least three vertices can have their edges assigned red labels~$1$ and $2$ and blue labels~$1$ and~$2$ so that any two adjacent vertices are distinguished either by their sums of incident red labels, or by their sums of incident blue labels. This problem emerged in a recent work aiming at proposing a general framework encapsulating several distinguishing labelling problems and notions, such as the well-known 1-2-3 Conjecture and so-called locally irregular decompositions. In this work, we prove that the Weak $(2,2)$-Conjecture holds for two classes of graphs defined in terms of forbidden induced structures, namely claw-free graphs and graphs with no pair of independent edges. One main point of interest for focusing on such classes of graphs is that the 1-2-3 Conjecture is not known to hold for them. Also, these two classes of graphs have unbounded chromatic number, while the 1-2-3 Conjecture is mostly understood for classes with bounded and low chromatic number.
Fichier principal
Vignette du fichier
9508.pdf (532.54 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03869508 , version 1 (24-11-2022)

Identifiers

Cite

Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille. The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures. CALDAM 2023 - 9th Annual International Conference on Algorithms and Discrete Applied Mathematics, Feb 2023, Gandhinagar, India. ⟨10.1007/978-3-031-25211-2_16⟩. ⟨hal-03869508⟩
33 View
36 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More