Cores of simplicial complexes

DOI10.1007/s00454-008-9081-yzbMath1157.57013arXivmath/0703351OpenAlexW2079310209MaRDI QIDQ958242

Mario Marietti, Damiano Testa

Publication date: 2 December 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0703351

zbMATH Keywords

forestgraph invariantsresolutionselementary collapse

Mathematics Subject Classification ID

General topology of complexes (57Q05) Planar graphs; geometric and topological aspects of graph theory (05C10) Other special types of modules and ideals in commutative rings (13C13)

Related Items

Networks beyond pairwise interactions: structure and dynamics ⋮ A note on independence complexes of chordal graphs and dismantling ⋮ Splittings of independence complexes and the powers of cycles ⋮ Cohomology of cluster varieties II: Acyclic case ⋮ Dominance complexes and vertex cover numbers of graphs ⋮ Four-cycled graphs with topological applications ⋮ Conical and spherical graphs ⋮ Independence complexes of chordal graphs ⋮ Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs ⋮ Matching complexes of trees and applications of the matching tree algorithm ⋮ Topology of acyclic complexes of tournaments and coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Directed trees in a string, real polynomials with triple roots, and chain mails
• On domination and independent domination numbers of a graph
• On the independence complex of square grids
• Certain homology cycles of the independence complex of grids
• Complexes of directed trees and independence complexes
• A note on total domination
• A linear algorithm for the domination number of a tree
• Linear algorithms on recursive representations of trees
• Complexes of directed trees
• Combinatorics and commutative algebra.
• Threshold graphs, shifted complexes, and graphical complexes
• The topology of the independence complex
• Total domination and matching numbers in claw-free graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• b-Matchings in Trees
• Vertices contained in every minimum dominating set of a tree