On well-covered, vertex decomposable and Cohen-Macaulay graphs

From MaRDI portal
Publication:289983

zbMATH Open1342.13030arXiv1505.00060MaRDI QIDQ289983FDOQ289983

Enrique Reyes, Roberto Cruz, Iván D. Castrillón

Publication date: 1 June 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let G=(V,E) be a graph. If G is a K"onig graph or G is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: DeltaG is pure shellable, R/IDelta is Cohen-Macaulay, G is unmixed vertex decomposable graph and G is well-covered with a perfect matching of K"onig type e1,...,eg without square with two ei'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.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (17)





This page was built for publication: On well-covered, vertex decomposable and Cohen-Macaulay graphs

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