Coloring some classes of mixed graphs


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 [xi, xj ], c(xi) = c(xj ) and for every arc (xp, xq), c(xp)< c(xq). We will analyse the complexity status of this problem for some special classes of graphs. © 2006 Elsevier B.V. All rights reserved. 
DOI: 10.1016/j.dam.2006.05.004


2 Figures and Tables

Slides referencing similar topics