Extending Berge's and Favaron's results about well-covered graphs
From MaRDI portal
Publication:394212
DOI10.1016/j.disc.2013.08.016zbMath1280.05097OpenAlexW2009136291MaRDI QIDQ394212
Márcia R. Cappelle, Dieter Rautenbach
Publication date: 24 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.016
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of well covered graphs of girth 5 or greater
- The structure of well-covered graphs and the complexity of their recognition problems
- Very well covered graphs
- Well-covered claw-free graphs
- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
- Complexity results for well‐covered graphs
- Local Structure When All Maximal Independent Sets Have Equal Weight
- WELL-COVERED GRAPHS: A SURVEY
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- On well-covered graphs of odd girth 7 or greater
- Recognizing Greedy Structures
- Well covered simplicial, chordal, and circular arc graphs
- Some covering concepts in graphs