New Results about Set Colorings of Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2010

New Results about Set Colorings of Graphs

Jean-Pierre Boutin
  • Fonction : Auteur
  • PersonId : 978141
Eric Duchêne
Hamida Seba

Résumé

The set coloring problem is a new kind of both vertex and edge coloring of a graph introduced by Suresh Hegde in 2009. Only large bounds have been given on the chromatic number for general graphs. In this paper, we consider the problem on paths and complete binary trees, and show that it can be reduced to the computation of a transversal in a special Latin square, i.e., the XOR table. We then investigate a variation of the problem called strong set coloring, and we provide an exhaustive list of all graphs being strongly set colorable with at most 4 colors.

Mots clés

Fichier non déposé

Dates et versions

hal-01285324 , version 1 (09-03-2016)

Identifiants

  • HAL Id : hal-01285324 , version 1

Citer

Jean-Pierre Boutin, Eric Duchêne, Brice Effantin, Hamamache Kheddouci, Hamida Seba. New Results about Set Colorings of Graphs. The Electronic Journal of Combinatorics, 2010, 17, pp.R173. ⟨hal-01285324⟩
51 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More