The complement of a connected bipartite graph is vertex decomposable

Mohammad Mahmoudi, Amir Mousivand, Siamak Yassemi

Associated to a simple undirected graph $G$ is a simplicial complex ${\Delta }_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if ${\Delta }_G$…