On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4489247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3567791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of well covered graphs of girth 5 or greater / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having maximal independent sets of exactly \(t\) distinct cardinalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well-covered graphs of odd girth 7 or greater / rank
 
Normal rank

Latest revision as of 07:00, 7 July 2024

scientific article
Language Label Description Also known as
English
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
scientific article

    Statements

    On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (English)
    0 references
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    0 references
    well-covered graph
    0 references
    maximal independent set
    0 references
    girth
    0 references
    0 references