scientific article; zbMATH DE number 1775058
From MaRDI portal
Publication:4542184
zbMath1004.52010MaRDI QIDQ4542184
Publication date: 4 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Discrete geometry (52C99) Theory of error-correcting codes and error-detecting codes (94B99) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (17)
Unnamed Item ⋮ On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces ⋮ Injective coloring of graphs revisited ⋮ New results on two hypercube coloring problems ⋮ The chromatic number of the square of the $8$-cube ⋮ Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes ⋮ Borsuk's partition problem and finite point sets ⋮ On a hypercube coloring problem ⋮ On the multiple Borsuk numbers of sets ⋮ The Borsuk partition problem: the seventieth anniversary ⋮ Exact distance graphs of product graphs ⋮ A distance-labelling problem for hypercubes ⋮ Around Borsuk's hypothesis ⋮ On the acyclic chromatic number of Hamming graphs ⋮ Integral point sets over \(\mathbb Z_n^m\) ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ Independence numbers and chromatic numbers of some distance graphs
This page was built for publication:
