Preprint
Shellability, vertex decomposability, and lexicographical products of graphs
Abstract
We investigate when the independence complex of $G[H]$, the lexicographical
product of two graphs $G$ and $H$, is either vertex decomposable or shellable.
Authors
Meulen KNV; Van Tuyl A
Publication date
May 11, 2015
DOI
10.48550/arxiv.1505.02838
Preprint server
arXiv