A note on independence complexes of chordal graphs and dismantling
From MaRDI portal
Publication:2363095
zbMath1366.05123arXiv1508.02426MaRDI QIDQ2363095
Publication date: 13 July 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02426
Structural characterization of families of graphs (05C75) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45)
Related Items
On the homology of independence complexes, Minimal graphs for contractible and dismantlable properties
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- Splittings of independence complexes and the powers of cycles
- Strong homotopy types, nerves and collapses
- Complexity of simplicial homology and independence complexes of chordal graphs
- On rigid circuit graphs
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Cores of simplicial complexes
- Certain homology cycles of the independence complex of grids
- Independence complexes of chordal graphs
- Algebraic properties of edge ideals via combinatorial topology
- Complexes of directed trees and independence complexes
- Simplicial simple-homotopy of flag complexes in terms of graphs
- Vertex-to-vertex pursuit in a graph
- Projective dimension, graph domination parameters, and independence complex homology
- Linear colorings of simplicial complexes and collapsing
- The topology of the independence complex
- Nerves of simplicial complexes
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Vertex decomposable graphs and obstructions to shellability
- Combinatorial algebraic topology
- Recognition of collapsible complexes is NP-complete
