A note on the pure Morse complex of a graph (Q952613): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Rafael Ayala / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Luis M. Fernández / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Antonio Quintero / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: José Antonio Vilches / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Frank Hagen Lutz / rank | |||
Normal rank | |||
Revision as of 08:50, 10 February 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
