Title of article
Coloring some classes of mixed graphs Original Research Article
Author/Authors
B. Ries، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
6
From page
1
To page
6
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 image, image and for every arc image, image. We will analyse the complexity status of this problem for some special classes of graphs.
Keywords
SAT , Bipartite graphs , Precoloring extension , Mixed graphs , Partial k-trees
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886393
Link To Document