In this paper we introduce and study a new coloring parameter of a graph called the strict
strong coloring (short SSColoring). A SSColoring of a graph G is a vertex proper coloring of …

This paper examines the graph coloring problem. A graph strict strong coloring algorithm
has been proposed for trees in Haddad and Kheddouci (2009). In this paper, the authors …

This paper tackles the strict strong graph coloring (SSColoring). This graph coloring task
aims at finding the minimum number of colors where each vertex dominates at least one non …

Various researches treating of the communication protocols try to define a certain
organization over the network to improve its general behavior. The concept of service is …

La coloration de graphes est un problème central de l'optimisation combinatoire. C'est un
domaine très attractif par ses nombreuses applications. Différentes variantes et …

In this paper, we introduce and study a new coloring problem of graphs called the double
total dominator coloring. A double total dominator coloring of a graph G with minimum …

This chapter examines the graph coloring problem. A graph strict strong coloring algorithm
has been proposed for trees in Haddad and Kheddouci (2009). In this chapter, the authors …

A very promising approach for combinatorial optimization is evolutionary algorithms. As an
application, this paper deals with the strict strong graph coloring problem defined by Haddad …

This paper addresses a recent combinatorial optimization problem called the Strict Strong
graph coloring. This new coloring parameter investigates the use of dominance relation …

Vertex coloring is one of the most studied problems in graph theory. It consists of coloring
vertices of a graph by a minimum number of colors called the chromatic number such that no …