Communication
Coloring some classes of mixed graphs

https://doi.org/10.1016/j.dam.2006.05.004Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Mixed graphs
Bipartite graphs
Partial k-trees
Precoloring extension
SAT

Cited by (0)