#### Filter Results:

#### Publication Year

2008

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Let G be a simple (i.e., no loops and no multiple edges) graph. We investigate the question of how to modify G combinatorially to obtain a sequentially Cohen-Macaulay graph. We focus on modifications given by adding configurations of whiskers to G, where to add a whisker one adds a new vertex and an edge connecting this vertex to an existing vertex in G. We… (More)

- ‹
- 1
- ›