A note on the pure Morse complex of a graph (Q952613)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5365223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the pure Morse complex of a graph |
scientific article; zbMATH DE number 5365223 |
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
0.8049782514572144
0 references
0.7947900295257568
0 references
0.7843488454818726
0 references
0.7721148133277893
0 references
0.7708049416542053
0 references
