A graph-theoretical approach to cancelling critical elements

DOI10.1016/j.endm.2011.05.049zbMath1268.05219OpenAlexW1990554081MaRDI QIDQ2840724

Rafael Ayala, José Antonio Vilches, Desamparados Fernández-Ternero

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.049

zbMATH Keywords

simplicial complexmaximum matchingHasse diagramoptimal discrete Morse function

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial aspects of simplicial complexes (05E45)

Related Items (1)

The main theorem of discrete Morse theory for Morse matchings with finitely many rays

Cites Work

• On optimizing discrete Morse functions
• A note on the pure Morse complex of a graph
• Morse theory for cell complexes
• Computing Optimal Morse Matchings
• MORSE INEQUALITIES ON CERTAIN INFINITE 2-COMPLEXES

This page was built for publication: A graph-theoretical approach to cancelling critical elements