Loading...
research article
On two coloring problems in mixed graphs
We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs. We consider two different coloring problems: in the first one we want adjacent vertices to have different colors and the tail of an arc to get a color strictly less than the head of this arc; in the second problem we allow vertices linked by an arc to have the same color. For both cases we present bounds on the mixed chromatic number and we give some complexity results which strengthen former results given in B.Ries "Coloring some classes of mixed graphs".
Type
research article
Web of Science ID
WOS:000254298700015
Authors
Publication date
2008
Published in
Volume
29
Start page
712
End page
725
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 4, 2006
Use this identifier to reference this record