| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421446 | Discrete Applied Mathematics | 2007 | 6 Pages |
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][xi,xj], c(xi)≠c(xj)c(xi)≠c(xj) and for every arc (xp,xq)(xp,xq), c(xp)
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
B. Ries,