Shedding vertices of vertex decomposable well-covered graphs
From MaRDI portal
Publication:1800408
DOI10.1016/j.disc.2018.07.029zbMath1397.05138DBLPjournals/dm/BakerMT18arXiv1606.04447OpenAlexW2890117438WikidataQ60692162 ScholiaQ60692162MaRDI QIDQ1800408
Adam Van Tuyl, Jonathan Baker, Kevin N. Vander Meulen
Publication date: 23 October 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.04447
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Cohen-Macaulay modules (13C14)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- Algebraic study on Cameron-Walker graphs
- Vertex decomposability and regularity of very well-covered graphs
- Partial coloring, vertex decomposability and sequentially Cohen-Macaulay simplicial complexes
- Algebraic properties of edge ideals via combinatorial topology
- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- A characterization of well covered graphs of girth 5 or greater
- Cohen-Macaulay graphs
- Very well covered graphs
- EdgeIdeals: a package for (hyper)graphs
- Simplicial decomposability
- nauty in Macaulay2
- Simplicial complexes of graphs
- Expansion of a simplicial complex
- Cohen–Macaulay Graphs and Face Vectors of Flag Complexes
- Vertex decomposable graphs and obstructions to shellability
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Shellable nonpure complexes and posets. II
- Well covered simplicial, chordal, and circular arc graphs
- Monomial Ideals
- Cohen–Macaulay graphs with large girth
- Cohen-Macaulay edge ideal whose height is half of the number of vertices
- Independence Complexes of Well-Covered Circulant Graphs
This page was built for publication: Shedding vertices of vertex decomposable well-covered graphs