Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Polychromatic Vertex Colorings of Cube Graphs

Jens-P. Bode1, Heiko Harborth1
1Diskrete Mathematik Technische Universitat Braunschweig 38023 Braunschweig, Germany
  • Published: 29/02/2012

Abstract

Let \(\gamma(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 \(\gamma(n, k)\) are determined.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Jens-P. Bode, Heiko Harborth. Polychromatic Vertex Colorings of Cube Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 080. 25-29. DOI: .