On well-covered, vertex decomposable and Cohen-Macaulay graphs
Combinatorics
2015-05-04 v1 Commutative Algebra
Abstract
Let be a graph. If is a K\"onig graph or is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: is pure shellable, is Cohen-Macaulay, is unmixed vertex decomposable graph and is well-covered with a perfect matching of K\"onig type without square with two 's. We characterize well-covered graphs without 3-cycles, 5-cycles and 7-cycles. Also, we study when graphs without 3-cycles and 5-cycles are vertex decomposable or shellable. Furthermore, we give some properties and relations between critical, extendables and shedding vertices. Finally, we characterize unicyclic graphs with each one of the following properties: unmixed, vertex decomposable, shellable and Cohen-Macaulay.
Keywords
Cite
@article{arxiv.1505.00060,
title = {On well-covered, vertex decomposable and Cohen-Macaulay graphs},
author = {Iván Dario Castrillón and Roberto Cruz and Enrique Reyes},
journal= {arXiv preprint arXiv:1505.00060},
year = {2015}
}