AbstractIn this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs, which arise from scheduling problems where disjunctive and precedence constraints have to be taken into account. We show that they are both NP-complete in cubic planar bipartite mixed graphs, which strengthens some results of Ries and de Werra (2008) [9]
AbstractIn the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of...
A mixed hypergraph is a triple H =(V,C, D) where V is the vertex set and C and D are families of sub...
In the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of a graph...
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and ar...
AbstractIn this note we consider two coloring problems in mixed graphs, i.e., graphs containing edge...
We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs.A ...
AbstractWe consider the coloring problem for mixed graphs, that is, for graphs containing edges and ...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
We are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriented and or...
AbstractWe are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges ...
We study complexity and approximation of min weighted node coloring in planar, bipartite and split g...
AbstractWe study complexity and approximation of min weighted node coloring in planar, bipartite and...
We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs...
We study complexity and approximation of min weighted node coloring in planar, bipartite and split g...
AbstractWe are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriente...
AbstractIn the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of...
A mixed hypergraph is a triple H =(V,C, D) where V is the vertex set and C and D are families of sub...
In the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of a graph...
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and ar...
AbstractIn this note we consider two coloring problems in mixed graphs, i.e., graphs containing edge...
We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs.A ...
AbstractWe consider the coloring problem for mixed graphs, that is, for graphs containing edges and ...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
We are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriented and or...
AbstractWe are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges ...
We study complexity and approximation of min weighted node coloring in planar, bipartite and split g...
AbstractWe study complexity and approximation of min weighted node coloring in planar, bipartite and...
We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs...
We study complexity and approximation of min weighted node coloring in planar, bipartite and split g...
AbstractWe are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriente...
AbstractIn the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of...
A mixed hypergraph is a triple H =(V,C, D) where V is the vertex set and C and D are families of sub...
In the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of a graph...
DOI
Add to ORKG