On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
From MaRDI portal
Publication:389981
DOI10.1016/j.disc.2013.04.019zbMath1281.05103OpenAlexW2022840766MaRDI QIDQ389981
Dieter Rautenbach, Márcia R. Cappelle, Rommel M. Barbosa
Publication date: 22 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.019
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
- A characterization of well covered graphs of girth 5 or greater
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
- On graphs having maximal independent sets of exactly \(t\) distinct cardinalities
- WELL-COVERED GRAPHS: A SURVEY
- On well-covered graphs of odd girth 7 or greater
- Some covering concepts in graphs