
A characterization is given of simplicial polytopes that are barycentric subdivisions of regular CW spheres. It is shown that barycentric subdivisions of connected polyhedral complexes with at least two facets determine the underlying complex uniquely up to duality. Connections with the algorithmic theory of comparability graphs are discussed. The f- vectors of regular CW spheres are characterized.
Graph theory, posets, 57Q99, barycentric subdivisions of regular CW spheres, Theory of computing, PL-topology, 52A25, simplicial polytopes, algorithmic theory of comparability graphs
Graph theory, posets, 57Q99, barycentric subdivisions of regular CW spheres, Theory of computing, PL-topology, 52A25, simplicial polytopes, algorithmic theory of comparability graphs
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
