Recognizing W₂ graphs
From MaRDI portal
Publication:6580488
Recommendations
Cites work
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 6783420 (Why is no real title available?)
- 1-well-covered graphs revisited
- A characterization of well covered graphs of girth 5 or greater
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Complexity results for well‐covered graphs
- On graphs admitting two disjoint maximum independent sets
- On maximal independent sets of vertices in claw-free graphs
- On relating edges in graphs without cycles of length 4
- On some subclasses of well-covered graphs
- The structure of well-covered graphs with no cycles of length 4
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs
- Vertex decomposable graphs and obstructions to shellability
- Weighted well-covered claw-free graphs
- Well-covered claw-free graphs
- Well-covered graphs without cycles of lengths 4, 5 and 6
- \(W_2\)-graphs and shedding vertices
This page was built for publication: Recognizing \(\text{W}_2\) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580488)