A note on the pure Morse complex of a graph (Q952613): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.topol.2007.04.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TOPOL.2007.04.023 / rank | |||
Normal rank | |||
Latest revision as of 09:44, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the pure Morse complex of a graph |
scientific article |
Statements
A note on the pure Morse complex of a graph (English)
0 references
12 November 2008
0 references
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.
0 references
discrete Morse function
0 references
pure discrete Morse complex
0 references
