Vertex decomposability of some complexes associated to graphs
From MaRDI portal
Cites work
- Cohen-Macaulay bipartite graphs
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Distributive lattices, bipartite graphs and Alexander duality
- General polygonal line tilings and their matching complexes
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1194481 (Why is no real title available?)
- scientific article; zbMATH DE number 16165 (Why is no real title available?)
- Hypergraph theory. An introduction
- Kneser's conjecture, chromatic number, and homotopy
- Obstructions to shellability
- On rigid circuit graphs
- On vertex decomposable simplicial complexes and their Alexander duals
- Perfect matching complexes of polygonal line tilings
- Resolutions of Stanley-Reisner rings and Alexander duality
- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- Shellable nonpure complexes and posets. II
- Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
- Topological results in combinatorics
- Total cut complexes of graphs
- Vertex decomposable graphs and obstructions to shellability
This page was built for publication: Vertex decomposability of some complexes associated to graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349114)