AbstractWe 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
A mixed graph has a set of vertices, a set of undirected egdes, and a set ofdirected arcs. A proper ...
AbstractA mixed hypergraph is a triple (V,C,D) where V is the vertex set and C and D are families of...
AbstractA mixed hypergraph H is a triple (V,C,D) where V is its vertex set and C and D are families ...
We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs.A ...
We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs...
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and a...
AbstractIn this note we consider two coloring problems in mixed graphs, i.e., graphs containing edge...
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 ...
AbstractWe are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriente...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
Coloring of mixed graphs that contain both directed arcs and undirected edges is relevant for schedu...
International audienceAn (m,n)-colored mixed graph is a mixed graph with arcs assigned one of m dif...
summary:A colored mixed graph has vertices linked by both colored arcs and colored edges. The chroma...
A mixed graph is a graph with directed edges, called arcs, and undirected edges. A k-coloring of the...
A mixed graph has a set of vertices, a set of undirected egdes, and a set ofdirected arcs. A proper ...
AbstractA mixed hypergraph is a triple (V,C,D) where V is the vertex set and C and D are families of...
AbstractA mixed hypergraph H is a triple (V,C,D) where V is its vertex set and C and D are families ...
We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs.A ...
We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs...
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and a...
AbstractIn this note we consider two coloring problems in mixed graphs, i.e., graphs containing edge...
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 ...
AbstractWe are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriente...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
Coloring of mixed graphs that contain both directed arcs and undirected edges is relevant for schedu...
International audienceAn (m,n)-colored mixed graph is a mixed graph with arcs assigned one of m dif...
summary:A colored mixed graph has vertices linked by both colored arcs and colored edges. The chroma...
A mixed graph is a graph with directed edges, called arcs, and undirected edges. A k-coloring of the...
A mixed graph has a set of vertices, a set of undirected egdes, and a set ofdirected arcs. A proper ...
AbstractA mixed hypergraph is a triple (V,C,D) where V is the vertex set and C and D are families of...
AbstractA mixed hypergraph H is a triple (V,C,D) where V is its vertex set and C and D are families ...
DOI
Add to ORKG