A note on the pure Morse complex of a graph (Q952613)

From MaRDI portal
Revision as of 01:43, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    0 references
    0 references
    0 references

    Identifiers