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 $[x_{i},x_{j}]$, $c(x_{i})\neq c(x_{j})$ and for every arc $(x_{p},x_{q})$, $c(x_{p})
Details
Title
Coloring some classes of mixed graphs
Author(s)
Ries, Bernard
Published in
Discrete Applied Mathematics
Volume
155
Pages
1-6
Date
2007
Other identifier(s)
DAR: 9798
View record in Web of Science
View record in Web of Science
Laboratories
ROSE
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSE - Chair of Operations Research SE
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-08-31