On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
From MaRDI portal
Publication:3655148
DOI10.1007/978-3-642-02029-2_14zbMath1194.05117OpenAlexW1842476630MaRDI QIDQ3655148
Publication date: 7 January 2010
Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_14
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Extending Berge's and Favaron's results about well-covered graphs ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Weighted well-covered claw-free graphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6
Cites Work
- A characterization of well covered graphs of girth 5 or greater
- The structure of well-covered graphs and the complexity of their recognition problems
- Well-covered claw-free graphs
- The structure of well-covered graphs with no cycles of length 4
- Local Structure When All Maximal Independent Sets Have Equal Weight
- Recognizing Greedy Structures
This page was built for publication: On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
