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
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Rommel M. Barbosa / rank
Normal rank
 
Property / author
 
Property / author: Rommel M. Barbosa / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6248994 / rank
 
Normal rank
Property / zbMATH Keywords
 
well-covered graph
Property / zbMATH Keywords: well-covered graph / rank
 
Normal rank
Property / zbMATH Keywords
 
maximal independent set
Property / zbMATH Keywords: maximal independent set / rank
 
Normal rank
Property / zbMATH Keywords
 
girth
Property / zbMATH Keywords: girth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2013.04.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022840766 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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