On a hypercube coloring problem
From MaRDI portal
Publication:703683
DOI10.1016/j.jcta.2004.06.010zbMath1061.05035OpenAlexW2021640907MaRDI QIDQ703683
Publication date: 11 January 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2004.06.010
Related Items (16)
The \(b\)-chromatic number of powers of hypercube ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ On the complexity of restoring corrupted colorings ⋮ Distance three labelings of trees ⋮ Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs ⋮ New results on two hypercube coloring problems ⋮ Graph 2-rankings ⋮ 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 ⋮ A distance-labelling problem for hypercubes ⋮ On the acyclic chromatic number of Hamming graphs ⋮ The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes ⋮ On transitive uniform partitions of \(F^n\) into binary Hamming codes ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ On coupon colorings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The triply shortened binary Hamming code is optimal
- A coloring problem in Hamming spaces
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- A coloring problem on the \(n\)-cube
- Unit sphere packings and coverings of the Hamming space
- New bounds on a hypercube coloring problem.
- Matroidal bijections between graphs
- 25 pretty graph colouring problems
This page was built for publication: On a hypercube coloring problem
