Coloring some classes of mixed graphs

Authors:
B. Ries
Affiliations:
Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 3
Cited 5

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Generalized Coloring for Tree-like Graphs

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Graphs and Hypergraphs

Graphs and Hypergraphs

On two coloring problems in mixed graphs

European Journal of Combinatorics
A note on mixed tree coloring

Information Processing Letters
Note: Complexity of two coloring problems in cubic planar bipartite mixed graphs

Discrete Applied Mathematics
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Vyacheslav Tanaev: contributions to scheduling and related areas

Journal of Scheduling

Quantified Score

Hi-index	0.04

Visualization

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] c(xi) ≠ c(xj) and for every arc (xp, xq), c(xp) c(xq). We will analyse the complexity status of this problem for some special classes of graphs.