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 24 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• 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)
• New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth (Q400363) (← 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)
• New results on \(k\)-independence of graphs (Q528993) (← links)
• Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
• A lower bound on the independence number of a graph (Q1584341) (← 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)
• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph (Q3296849) (← links)
• (Q3752410) (← links)
• Improved lower bounds on <i>k</i>‐independence (Q3970967) (← links)
• New bounds on the independence number of connected graphs (Q4554556) (← links)
• Perfect roman domination in regular graphs (Q5155702) (← links)
• A new notion of vertex independence and rank for finite graphs (Q5246507) (← links)
• Packing in regular graphs (Q5375889) (← links)
• Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← 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)
• The packing number of cubic graphs (Q6602335) (← links)