Pages that link to "Item:Q516816"

The following pages link to Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816):

Displaying 7 items.

• A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
• New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth (Q400363) (← links)
• A new lower bound on the independence number of a graph and applications (Q405126) (← links)
• An improved lower bound on the independence number of a graph (Q477342) (← links)
• The lower bound on independence number. (Q1609723) (← links)
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
• Rank and chromatic number of a graph (Q4355066) (← links)