Shellability of simple graphs and hypergraphs containing a simplicial vertex

MaRDI QIDQ2943701zbMATH OpenFDO

Authors Iván D. Castrillón, Roberto Cruz

Publication date 4 September 2015

zbMATH Keywords

independence complexshellable cluttersshellable graphssimplicial vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Syzygies, resolutions, complexes and commutative rings (13D02) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Recommendations

• Vertex decomposable graphs and obstructions to shellability
• Unmixed simple clutters, shellable simplicial complexes and Stanley-Reisner rings
• k-shellable simplicial complexes and graphs
• Edgewise strongly shellable clutters
• Shellability, vertex decomposability, and lexicographical products of graphs

Cited in

(12)

• On simplicial and co-simplicial vertices in graphs.
• Graphs and balanced simplicial complexes
• Shellability of polyhedral joins of simplicial complexes and its application to graph theory
• Decomposable clutters and a generalization of Simon's conjecture
• On well-covered, vertex decomposable and Cohen-Macaulay graphs
• Vertex decomposable graphs and obstructions to shellability
• Shellable Cactus Graphs
• Shellability, vertex decomposability, and lexicographical products of graphs
• Edgewise strongly shellable clutters
• Shellability of simplicial complexes and simplicial complexes with the free vertex property
• k-shellable simplicial complexes and graphs
• scientific article; zbMATH DE number 1890144 (Why is no real title available?)

This page was built for publication: Shellability of simple graphs and hypergraphs containing a simplicial vertex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943701)