Abstract
In this paper a newclass of vertex decomposable graphs are determined. Moreover, all shellable and sequentially Cohen-Macaulay cactus graphs (i.e., connected graphs in which each edge belongs to at most one cycle) are characterized.
Cite
CITATION STYLE
APA
Mohammadi, F., Kiani, D., & Yassemi, S. (2010). Shellable cactus graphs. Mathematica Scandinavica, 106(2), 161–167. https://doi.org/10.7146/math.scand.a-15130
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free