A coloring problem on the \(n\)-cube
From MaRDI portal
Publication:1570845
DOI10.1016/S0166-218X(99)00249-8zbMath0949.05024MaRDI QIDQ1570845
Panos M. Pardalos, Dongsoo S. Kim, Ding-Zhu Du
Publication date: 29 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (22)
A channel assignment problem for optical networks modelled by Cayley graphs ⋮ The \(b\)-chromatic number of powers of hypercube ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ An optimal square coloring of planar graphs ⋮ Distance three labelings of trees ⋮ New results on two hypercube coloring problems ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ The clique distribution in powers of hypercubes ⋮ The chromatic number of the square of the $8$-cube ⋮ Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes ⋮ The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs ⋮ 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 ⋮ Acyclic and \(k\)-distance coloring of the grid ⋮ Silver cubes ⋮ Two coloring problems on matrix graphs ⋮ The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes ⋮ New bounds on a hypercube coloring problem. ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ On coupon colorings of graphs
Cites Work
This page was built for publication: A coloring problem on the \(n\)-cube
