Cores of simplicial complexes

14Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. Applying this method to complexes arising from graphs, we give topological meaning to classical graph invariants. As a consequence, we answer some questions raised in (Ehrenborg and Hetyei in Eur. J. Comb. 27(6):906-923, 2006) on the independence complex and the dominance complex of a forest and obtain improved algorithms to compute their homotopy types. © 2008 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Marietti, M., & Testa, D. (2008). Cores of simplicial complexes. Discrete and Computational Geometry, 40(3), 444–468. https://doi.org/10.1007/s00454-008-9081-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free