Dominated coloring of graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Dominated coloring of graphs

Hocine Boumediene Merouane
  • Fonction : Auteur
Mohammed Haddad
Mustapha Chellali
  • Fonction : Auteur

Résumé

In this paper, we introduce and study a new coloring prob- lem of a graph called the Dominated coloring (short Domcoloring). A Domcoloring of a graph G is a vertex proper coloring of G such that each color class is dominated by at least one vertex of G. The minimum number of colors among all Domcolorings is called dominated chromatic (short Domchromatic) number, denoted by χdom(G). In this paper we prove the NP-completeness of the problem and give some bounds and exact values for the Domchromatic number for some graph classes.
Fichier non déposé

Dates et versions

hal-01353161 , version 1 (10-08-2016)

Identifiants

  • HAL Id : hal-01353161 , version 1

Citer

Hocine Boumediene Merouane, Mohammed Haddad, Mustapha Chellali, Hamamache Kheddouci. Dominated coloring of graphs. 11th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, May 2012, Universitat der Bundeswehr Munchen, Neubiberg, Germany. pp.189-192. ⟨hal-01353161⟩
136 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More