Nouioua Leila

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A generalization of the classical graph coloring model is studied in this paper. The problem we are interested in is the T-coloring problem related in the literature. It consists on coloring the vertices of a graph in such a way that the two colors assigned to two adjacent vertices i and j does not appear in Tij, where Tij is a set of positive integers(More)
  • 1