加载中…
The oriented chromatic number of a directed graph is the minimum order of an oriented graph to which has a homomorphism. The oriented chromatic number of a graph family is the maximum oriented chromatic number over any orientation of any graph in . For the family of hexagonal grids , Bielak (2006) proved that $5 \le \chi_o({\cal H}_2) \le 6\chi_o({\cal H}_2) \ge 6$.

生成讲解博客的中文版本

生成AI智能校验的中文版本