Abstract
Let G = (V, E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ΔG is pure shellable, R/IΔ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1,…, eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and shellable (non-pure) properties in graphs without 3-cycles and 5-cycles. Finally, we give some properties and relations between critical, extendable and shedding vertices.
Author supplied keywords
Cite
CITATION STYLE
Castrillón, I. D., Cruz, R., & Reyes, E. (2016). On well-covered, vertex decomposable and Cohen-Macaulay graphs. Electronic Journal of Combinatorics, 23(2). https://doi.org/10.37236/5874
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.