On two coloring problems in mixed graphs

Authors:
B. Ries;D. de Werra
Affiliations:
Ecole Polytechnique Fédérale de Lausanne, FSB-IMA-ROSE, Station 8, CH-1015 Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, FSB-IMA-ROSE, Station 8, CH-1015 Lausanne, Switzerland
Venue:
European Journal of Combinatorics
Year:
2008

Citing 6
Cited 4

Reasoning about qualitative temporal information

Artificial Intelligence - Special volume on constraint-based reasoning
Smallest-last ordering and clustering and graph coloring algorithms

Journal of the ACM (JACM)
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
Hard coloring problems in low degree planar bipartite graphs

Discrete Applied Mathematics
Coloring some classes of mixed graphs

Discrete Applied Mathematics

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
Routing equal-size messages on a slotted ring

Journal of Scheduling
Vyacheslav Tanaev: contributions to scheduling and related areas

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 a color of the head of this arc; in the second problem, we also 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 earlier results given in [B. Ries, Coloring some classes of mixed graphs, Discrete Applied Mathematics 155 (2007) 1-6].