A note on the pure Morse complex of a graph (Q952613): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.topol.2007.04.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970131123 / rank | |||
Normal rank | |||
Revision as of 00:51, 20 March 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
