We obtain some improved upper and lower bounds on the oriented chromatic number for different classes of products of graphs
AbstractAn oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph ...
Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta...
AbstractWe combine two topics in directed graphs which have been studied separately, vertex pushing ...
The oriented chromatic number of an oriented graph $^→G$ is the minimum order of an oriented graph $...
The oriented chromatic number Ø o ( ~ G) of an oriented graph ~ G = (V; A) is the minimum number o...
Abstract. Let G be a graph with n vertices, m edges, average degree d, and maximum degree . The orie...
The oriented chromatic number χo(~G) of an oriented graph ~G = (V,A) is the minimum number of vertic...
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without sel...
Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
International audiencePushing a vertex in an oriented graph means reversing the direction of all the...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
AbstractA lower bound is obtained for the chromatic number X(G) of a graph G in terms of its vertex ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
AbstractAn oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph ...
Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta...
AbstractWe combine two topics in directed graphs which have been studied separately, vertex pushing ...
The oriented chromatic number of an oriented graph $^→G$ is the minimum order of an oriented graph $...
The oriented chromatic number Ø o ( ~ G) of an oriented graph ~ G = (V; A) is the minimum number o...
Abstract. Let G be a graph with n vertices, m edges, average degree d, and maximum degree . The orie...
The oriented chromatic number χo(~G) of an oriented graph ~G = (V,A) is the minimum number of vertic...
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without sel...
Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
International audiencePushing a vertex in an oriented graph means reversing the direction of all the...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
AbstractA lower bound is obtained for the chromatic number X(G) of a graph G in terms of its vertex ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
AbstractAn oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph ...
Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta...
AbstractWe combine two topics in directed graphs which have been studied separately, vertex pushing ...
DOI
Add to ORKG