W2-graphs and shedding vertices

  title={W2-graphs and shedding vertices},
  author={Vadim E. Levit and Eugen Mandrescu},
  journal={Electronic Notes in Discrete Mathematics},
A graph is well-covered if all its maximal independent sets are of the same size (Plummer, 1970). A well-covered graph is 1-well-covered if the deletion of every vertex leaves a graph which is well-covered as well (Staples, 1975). A graph G belongs to class Wn if every n pairwise disjoint independent sets in G are included in n pairwise disjoint maximum independent sets (Staples, 1975). Clearly, W1 is the family of all well-covered graphs. It turns out that G ∈ W2 if and only if it is a 1-well… CONTINUE READING
1 Citations
20 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 20 references

A characterization of triangle-free Gorenstein graphs and Cohen–Macaulayness of second powers of edge ideals

  • D. T. Hoang, T. N. Trung
  • J. Algebraic Combin
  • 2016
1 Excerpt

Shedding vertices of vertex decomposable graphs, arXiv:1606.04447 [math.CO] (2016

  • J. Baker, K. N. Vander Meulen, A. Van Tuyl
  • 2016
1 Excerpt

Cohen-Macaulay graphs with large girth

  • D. T. Hoang, N. C. Minh, T. N. Trung
  • J. Algebra Appl
  • 2015
1 Excerpt

Similar Papers

Loading similar papers…