Pages that link to "Item:Q405126"

The following pages link to A new lower bound on the independence number of a graph and applications (Q405126):

Displaying 10 items.

• A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• An improved lower bound on the independence number of a graph (Q477342) (← links)
• Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
• A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
• Zero forcing in claw-free cubic graphs (Q2302052) (← links)
• Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
• A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
• The Tuza–Vestergaard Theorem (Q6161262) (← links)
• Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)