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.


Published in:
Discrete Applied Mathematics, 155, 1-6
Year:
2007
Keywords:
Other identifiers:
Laboratories:




 Record created 2006-08-31, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)