Independence complexes of chordal graphs
From MaRDI portal
Publication:982628
DOI10.1016/j.disc.2010.04.021zbMath1219.05123OpenAlexW1975934516MaRDI QIDQ982628
Publication date: 7 July 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.021
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ A note on independence complexes of chordal graphs and dismantling ⋮ Topology of clique complexes of line graphs ⋮ Higher Independence Complexes of graphs and their homotopy types ⋮ On a lower bound for the connectivity of the independence complex of a graph ⋮ Splittings of independence complexes and the powers of cycles ⋮ Dominance complexes and vertex cover numbers of graphs ⋮ Complexity of simplicial homology and independence complexes of chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Cores of simplicial complexes
- A uniform approach to complexes arising from forests
- Complexes of directed trees and independence complexes
- Domination numbers and homology
- A tree version of Kőnig's theorem
- Independent systems of representatives in weighted graphs
- Independence complexes of claw-free graphs
- The topology of the independence complex
- Hall's theorem for hypergraphs
- Combinatorial algebraic topology