@article {
author = {Hajisharifi, Nasser and Tehranian, Abolfazl},
title = {A new construction for vertex decomposable graphs},
journal = {Transactions on Combinatorics},
volume = {5},
number = {3},
pages = {33-38},
year = {2016},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2016.13316},
abstract = {Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $S \subseteq V(G)$. Adding a whisker to $G$ at $x$ means adding a new vertex $y$ and edge $xy$ to $G$ where $x \in V(G)$. The graph $G\cup W(S)$ is obtained from $G$ by adding a whisker to every vertex of $S$. We prove that if $G\setminus S$ is either a graph with no chordless cycle of length other than $3$ or $5$, chordal graph or $C_5$, then $G \cup W(S)$ is a vertex decomposable graph.},
keywords = {vertex decomposable,shellabel,Cohen-Macaulay},
url = {https://toc.ui.ac.ir/article_13316.html},
eprint = {https://toc.ui.ac.ir/article_13316_43779a03b5b9504e38c712a31b3b66d0.pdf}
}