On Minimizing the Maximum Color for the 1-2-3 Conjecture - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2021

On Minimizing the Maximum Color for the 1-2-3 Conjecture


The 1-2-3 Conjecture asserts that, for every connected graph different from K2 , its edges can be labeled with 1,2,3 so that, when coloring each vertex with the sum of its incident labels, no two adjacent vertices get the same color. This conjecture takes place in the more general context of distinguishing labelings, where the goal is to label graphs so that some pairs of their elements are distinguishable relatively to some parameter computed from the labeling. In this work, we investigate the consequences of labeling graphs as in the 1-2-3 Conjecture when it is further required to make the maximum resulting color as small as possible. In some sense, we aim at producing a number of colors that is as close as possible to the chromatic number of the graph. We first investigate the hardness of determining the minimum maximum color by a labeling for a given graph, which we show is NP-complete in the class of bipartite graphs but polynomial-time solvable in the class of graphs with bounded treewidth. We then provide bounds on the minimum maximum color that can be generated both in the general context, and for particular classes of graphs. Finally, we study how using larger labels permits to reduce the maximum color.
Fichier principal
Vignette du fichier
maxWeightIndirectColoring_revised.pdf (587.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02330418 , version 1 (24-10-2019)
hal-02330418 , version 2 (03-09-2020)



Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse. On Minimizing the Maximum Color for the 1-2-3 Conjecture. Discrete Applied Mathematics, 2021, 289, pp.32-51. ⟨10.1016/j.dam.2020.09.020⟩. ⟨hal-02330418v2⟩
195 View
181 Download



Gmail Facebook X LinkedIn More