Zheng-Yiao Han

most citedOn two

q

-ary

n

-cube coloring problems

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2015

Two coloring problems on matrix graphs

Zhe Han, Mei Lu

In this paper, we propose a new family of graphs, matrix graphs, whose vertex set $F_{q}^{N \times n}$ is the set of all $N \times n$ matrices over a finite field $\mathbb{F}_…

math.CO2015★ 1 cited

On two $q$ -ary $n$ -cube coloring problems

Z. Han, M. Lu

Let $χ_{d}^{'} (n, q)$ (resp. $χ_{d} (n, q)$ ) denote the minimum number of colors necessary to color a $q$ -ary $n$ -cube so that no two vertices that are at a distance at most $d$ (resp. exact…

Two coloring problems on matrix graphs

On two q-ary n-cube coloring problems

On two $q$ -ary $n$ -cube coloring problems