Polychromatic Vertex Colorings of Cube Graphs

Abstract

Let $g(n,k)$ be the maximum number of colors for the vertices of the cube graph $Q_n$, such that each subcube $Q_k$ contains all colors. Some exact values of $g(n,k)$ are determined.