On some subclasses of well-covered graphs
From MaRDI portal
Cites work
Cited in
(33)- Well-covered graphs and extendability
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
- Strongly well-covered graphs
- Using maximality and minimality conditions to construct inequality chains
- Well-located graphs: A collection of well-covered ones
- Equimatchable claw-free graphs
- W₂-graphs and shedding vertices
- The roller-coaster conjecture revisited
- Graph operations preserving \(W_{2}\)-property
- The v-number of edge ideals
- On Gorenstein graphs
- 1-well-covered graphs revisited
- Edge-stable equimatchable graphs
- A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
- Modeling k-coteries by well-covered graphs
- WELL-COVERED GRAPHS: A SURVEY
- A characterization of Zm-well-covered graphs of girth 6 or more
- On graphs admitting two disjoint maximum independent sets
- Cohen-Macaulayness of saturation of the second power of edge ideals
- A classification of 1-well-covered graphs
- scientific article; zbMATH DE number 7308162 (Why is no real title available?)
- Cohen-Macaulay graphs with large girth
- On Gorenstein circulant graphs
- Line graphs with a Cohen-Macaulay or Gorenstein clique complex
- Critical equimatchable graphs
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs
- Recognizing \(\text{W}_2\) graphs
- 1-well-covered graphs containing a clique of size \(n/3\)
- Regular edges, matchings and Hilbert series
- Recognizing relating edges in graphs without cycles of length 6
- Log-concavity of the independence polynomials of \(\mathbf{W}_p\) graphs
- Some combinatorial characterizations of Gorenstein graphs with independence number less than four
- Planar ternary graphs, flag spheres, and Delannoy polynomials
This page was built for publication: On some subclasses of well-covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189306)
