A note on the pure Morse complex of a graph
The authors characterize the pure discrete Morse complex of a tree and prove that it is collapsible. Moreover, they express the pure discrete Morse complex of a general graph as the union of all pure discrete Morse complexes corresponding to spanning trees.
scientific article; zbMATH DE number 5365223