The oriented chromatic number of a directed graph $G$ is the minimum order of an oriented graph to which $G$ has a homomorphism. The oriented chromatic number $\chi_o({\cal F})$ of a graph family ${\cal F}$ is the maximum oriented chromatic number over any orientation of any graph in ${\cal F}$. For the family of hexagonal grids ${\cal H}_2$, Bielak (2006) proved that $5 \le \chi_o({\cal H}_2) \le 6$. Here we close the gap by showing that $\chi_o({\cal H}_2) \ge 6$.Comment: 8 pages, 5 figure
Abstract. Let G be a graph with n vertices, m edges, average degree d, and maximum degree . The orie...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
A homomorphism of an oriented graph G to an oriented graph H is a mapping ' from the vertex se...
The oriented chromatic number of a directed graph $G$ is the minimum order of an oriented graph to w...
We define some infinite subfamily of hexagonal grids with the oriented chromatic number 5. We presen...
International audiencePushing a vertex in an oriented graph means reversing the direction of all the...
The oriented chromatic number Ø o ( ~ G) of an oriented graph ~ G = (V; A) is the minimum number o...
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...
AbstractThe excess of a graph G is defined as the minimum number of edges that must be deleted from ...
International audienceThe oriented (resp. 2-edge-coloured) chromatic number χₒ(G) (resp. χ₂(G)) of a...
The oriented chromatic number χo(~G) of an oriented graph ~G = (V,A) is the minimum number of vertic...
International audienceThe oriented (resp. 2-edge-coloured) chromatic number χₒ(G) (resp. χ₂(G)) of a...
AbstractThe oriented chromatic number o(H) of an oriented graph H is defined as the minimum order of...
AbstractAn oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph ...
Abstract. Let G be a graph with n vertices, m edges, average degree d, and maximum degree . The orie...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
A homomorphism of an oriented graph G to an oriented graph H is a mapping ' from the vertex se...
The oriented chromatic number of a directed graph $G$ is the minimum order of an oriented graph to w...
We define some infinite subfamily of hexagonal grids with the oriented chromatic number 5. We presen...
International audiencePushing a vertex in an oriented graph means reversing the direction of all the...
The oriented chromatic number Ø o ( ~ G) of an oriented graph ~ G = (V; A) is the minimum number o...
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...
AbstractThe excess of a graph G is defined as the minimum number of edges that must be deleted from ...
International audienceThe oriented (resp. 2-edge-coloured) chromatic number χₒ(G) (resp. χ₂(G)) of a...
The oriented chromatic number χo(~G) of an oriented graph ~G = (V,A) is the minimum number of vertic...
International audienceThe oriented (resp. 2-edge-coloured) chromatic number χₒ(G) (resp. χ₂(G)) of a...
AbstractThe oriented chromatic number o(H) of an oriented graph H is defined as the minimum order of...
AbstractAn oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph ...
Abstract. Let G be a graph with n vertices, m edges, average degree d, and maximum degree . The orie...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
A homomorphism of an oriented graph G to an oriented graph H is a mapping ' from the vertex se...