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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Derives explicit formula for updated boundary and coboundary operators after critical pair cancellation in discrete Morse theory using original operators.
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.
-
Cancellation of a critical pair in discrete Morse theory and its effect on (co)boundary operators
Derives explicit formula for updated boundary and coboundary operators after critical pair cancellation in discrete Morse theory using original operators.