33 citations · 172 across the 25 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.MG2015★ 9 cited
Scribability problems for polytopes
Hao Chen, Arnau Padrol
In this paper we study various scribability problems for polytopes. We begin with the classical -scribability problem proposed by Steiner and generalized by Schulte, which asks…
math.CO2015★ 3 cited
Ball packings with high chromatic numbers from strongly regular graphs
Hao Chen
Inspired by Bondarenko's counter-example to Borsuk's conjecture, we notice some strongly regular graphs that provide examples of ball packings whose chromatic numbers are significa…