Discrete Morse theory on graphs
From MaRDI portal
Publication:1032958
DOI10.1016/j.topol.2009.01.022zbMath1186.05086OpenAlexW1963675492MaRDI QIDQ1032958
Luis M. Fernández, Rafael Ayala, José Antonio Vilches, Desamparados Fernández-Ternero
Publication date: 5 November 2009
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.topol.2009.01.022
Relations of low-dimensional topology with graph theory (57M15) Simplicial sets and complexes in algebraic topology (55U10) Infinite graphs (05C63)
Related Items (8)
Unnamed Item ⋮ Merge trees in discrete Morse theory ⋮ Persistent pairs and connectedness in discrete Morse functions on simplicial complex. I ⋮ The number of excellent discrete Morse functions on graphs ⋮ Kauffman's clock lattice as a graph of perfect matchings: a formula for its height ⋮ Persistent homology for hypergraphs and computational tools — A survey for users ⋮ Discrete Morse functions, vector fields, and homological sequences on trees ⋮ Discrete Morse theory on graphs
Cites Work
- Unnamed Item
- Characterizing equivalent discrete Morse functions
- On optimizing discrete Morse functions
- A note on the pure Morse complex of a graph
- Discrete Morse theory on graphs
- Morse theory for cell complexes
- Optimal discrete Morse functions for 2-manifolds
- Note on André's reflection principle
- Generating Discrete Morse Functions from Point Data
- Counting Morse functions on the 2-sphere
- MORSE INEQUALITIES ON CERTAIN INFINITE 2-COMPLEXES
This page was built for publication: Discrete Morse theory on graphs