New bounds on a hypercube coloring problem.

DOI10.1016/S0020-0190(02)00301-0zbMath1042.68083OpenAlexW2100597435MaRDI QIDQ1853150

Ronald L. Graham, Ding-Zhu Du, Hung Quang Ngo

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00301-0

zbMATH Keywords

cubeColoringCombinatorial problems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The \(b\)-chromatic number of powers of hypercube, BCH codes and distance multi- or fractional colorings in hypercubes asymptotically, Distance three labelings of trees, New results on two hypercube coloring problems, The chromatic number of the square of the $8$-cube, Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes, On \(b\)-coloring of powers of hypercubes, On a hypercube coloring problem, The \(L(h,1,1)\)-labelling problem for trees, A distance-labelling problem for hypercubes, On the acyclic chromatic number of Hamming graphs, Two coloring problems on matrix graphs, The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes, Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

Cites Work

• Unnamed Item
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube