Journal article

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 $[x_{i},x_{j}]$, $c(x_{i})\neq c(x_{j})$ and for every arc $(x_{p},x_{q})$, $c(x_{p})<c(x_{q})$. We will analyse the complexity status of this problem for some special classes of graphs.


  • There is no available fulltext. Please contact the lab or the authors.

Related material