Springe direkt zu Inhalt

Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions

Günter M. Ziegler – 2001

Titel
Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions
Verfasser
Günter M. Ziegler
Verlag
Springer-Verlag
Datum
2001
Erschienen in
Computational Discrete Mathematics Lectures, Lecture Notes in Computer Science, volume 2122, pages 159-171
Art
Text