A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Dieter Rautenbach / 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: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6595946 / rank
 
Normal rank
Property / zbMATH Keywords
 
independent set
Property / zbMATH Keywords: independent set / rank
 
Normal rank
Property / zbMATH Keywords
 
chromatic number
Property / zbMATH Keywords: chromatic number / rank
 
Normal rank
Property / zbMATH Keywords
 
clique
Property / zbMATH Keywords: clique / rank
 
Normal rank

Revision as of 21:28, 27 June 2023

scientific article
Language Label Description Also known as
English
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
scientific article

    Statements

    A lower bound on the independence number of a graph in terms of degrees and local clique sizes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2016
    0 references
    independent set
    0 references
    chromatic number
    0 references
    clique
    0 references

    Identifiers