Flex complexes of graphs
From MaRDI portal
Cites work
- A linear-time algorithm for finding a minimum spanning pseudoforest
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Combinatorial algebraic topology
- Computational homology
- Configuration spaces of labeled points on a circle with two anchors
- Discrete Morse Theory
- Homology and Euler characteristic of generalized anchored configuration spaces of graphs
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3411897 (Why is no real title available?)
- Linear algorithms for edge-coloring trees and unicyclic graphs
- Morse theory. Smooth and discrete
- Organized collapse. An introduction to discrete Morse theory
- Stirling complexes
This page was built for publication: Flex complexes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288386)