Beyond recognizing well-covered graphs
From MaRDI portal
Cites work
- W₂-graphs and shedding vertices
- A characterization of well covered graphs of girth 5 or greater
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Bounded Query Classes
- Complexity results for well‐covered graphs
- Graphs vertex-partitionable into strong cliques
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3614795 (Why is no real title available?)
- scientific article; zbMATH DE number 2080215 (Why is no real title available?)
- Local Structure When All Maximal Independent Sets Have Equal Weight
- More complicated questions about maxima and minima, and some closures of NP
- On \(\alpha\)-excellent graphs
- On rigid circuit graphs
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
- Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
- Some covering concepts in graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs
- Well covered simplicial, chordal, and circular arc graphs
- Well-covered claw-free graphs
- Well-covered graphs and extendability
- WELL-COVERED GRAPHS: A SURVEY
Cited in
(2)
This page was built for publication: Beyond recognizing well-covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988720)
