A Vizing-like theorem for union vertex-distinguishing edge coloring - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2017

A Vizing-like theorem for union vertex-distinguishing edge coloring

Nicolas Bousquet
Antoine Dailly
Eric Duchene
Aline Parreau

Abstract

We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the problem of finding a coloring with the minimum number of colors where every vertex receives a distinct label. Finding such a coloring generalizes several other well-known problems of vertex-distinguishing colorings in graphs. We show that for any graph (without connected component reduced to an edge or a single vertex), the minimum number of colors for which such a coloring exists can only take 3possible values depending on the order of the graph. Moreover, we provide the exact value for paths, cycles and complete binary trees.
Fichier principal
Vignette du fichier
articleChiURevised.pdf (403.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01313088 , version 1 (09-05-2016)
hal-01313088 , version 2 (17-07-2017)

Identifiers

Cite

Nicolas Bousquet, Antoine Dailly, Eric Duchene, Hamamache Kheddouci, Aline Parreau. A Vizing-like theorem for union vertex-distinguishing edge coloring. Discrete Applied Mathematics, 2017, 232, pp.88-98. ⟨10.1016/j.dam.2017.07.002⟩. ⟨hal-01313088v2⟩
546 View
202 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More