A lower bound on independence in terms of degrees (Q548268): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Independence in connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of a graph in terms of order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the independence number of a graph in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foreword: Special issue on stability in graphs and related topics / rank
 
Normal rank

Latest revision as of 05:10, 4 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on independence in terms of degrees
scientific article

    Statements

    Identifiers