An improved lower bound on the independence number of a graph (Q477342): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A new lower bound on the independence number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The potential of greed for independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, clique size and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent domination number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the independence number in terms of the degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds on the order, size, and stability number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on independence in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number in graphs of maximum degree three / rank
 
Normal rank
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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the independence number of a graph and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in graphs with maximum degree four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, odd girth, and average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the independence number of certain graphs of odd girth at least seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of graphs / rank
 
Normal rank

Revision as of 09:03, 9 July 2024

scientific article
Language Label Description Also known as
English
An improved lower bound on the independence number of a graph
scientific article

    Statements

    An improved lower bound on the independence number of a graph (English)
    0 references
    0 references
    0 references
    3 December 2014
    0 references
    independence
    0 references
    vertex-cover
    0 references

    Identifiers