Coloring some classes of mixed graphs Original Research Article

We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs. A mixed coloring c is a coloring such that for every edge image, image and for every arc image, image. We will analyse the complexity status of this problem for some special classes of graphs.