Loading...
research article
Coloring some classes of mixed graphs
Ries, Bernard
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.
Type
research article
Web of Science ID
WOS:000243254100001
Authors
Ries, Bernard
Publication date
2007
Published in
Volume
155
Start page
1
End page
6
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
August 31, 2006
Use this identifier to reference this record