The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
From MaRDI portal
Publication:886453
zbMath1229.52011MaRDI QIDQ886453
Publication date: 27 June 2007
Published in: Doklady Mathematics (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (4)
Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Independence numbers and chromatic numbers of some distance graphs
This page was built for publication: The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
