A recursive construction of acyclic matchings on independence complexes for graphs with simplicial vertices yields homotopy types for chordal graphs and generalized comparability graphs via discrete Morse theory.
Toward optimality in discrete Morse theory.Experimental Mathematics, 12, 01 2003
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A recursive construction of an acyclic matching on the independence complex of a graph with a simplicial vertex
A recursive construction of acyclic matchings on independence complexes for graphs with simplicial vertices yields homotopy types for chordal graphs and generalized comparability graphs via discrete Morse theory.