𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a hypercube coloring problem

✍ Scribed by Patric R.J. ÖstergÅrd

Book ID
108167122
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
167 KB
Volume
108
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New bounds on a hypercube coloring probl
New bounds on a hypercube coloring problem
✍ Hung Quang Ngo; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 57 KB

In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of χ k (n), the minimum number of

A coloring problem
A coloring problem
✍ V. L. Dol'nikov 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 725 KB
On a leverage problem in the hypercube
On a leverage problem in the hypercube
✍ Peter Hamburger; Raymond E. Pippert; W. Douglas Weakley 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB
On the max coloring problem
On the max coloring problem
✍ Epstein, Leah; Levin, Asaf 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 380 KB