Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions

Günter M. Ziegler. Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. In Helmut Alt, editor, Computational Discrete Mathematics, Advanced Lectures. Volume 2122 of Lecture Notes in Computer Science, pages 159-172, Springer, 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.