In this paper, we introduce and study a new coloring problem of a graph called the
dominated coloring. A dominated coloring of a graph GG is a proper vertex coloring of GG …

In this paper, we are interested in four proper vertex colorings of graphs, with additional
domination property. In the dominator colorings, strong colorings and strict strong colorings …

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 …

We consider the problem of matching unrooted unordered labeled trees, which refers to the
task of evaluating the distance between trees. One of the most famous formalizations of this …

State space explosion is a fundamental obstacle in formal verification of concurrent systems.
As a solution for this problem, this paper deals with distributed state space. The authors' …

A strict strong coloring of a graph G is a proper coloring of G in which every vertex of the
graph is adjacent to every vertex of some color class. The minimum number of colors …

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 …

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 …