Pages that link to "Item:Q1584341"

The following pages link to A lower bound on the independence number of a graph (Q1584341):

Displaying 22 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• A solution to an open problem on lower against number in graphs (Q266038) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• On average lower independence and domination numbers in graphs (Q556830) (← links)
• Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph (Q1265892) (← links)
• Lower bounds for constant degree independent sets (Q1322210) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• The \(k\)-regular induced subgraph problem (Q1786867) (← links)
• An upper bound on the independence number of a graph computable in polynomial-time (Q1919180) (← links)
• A new lower bound on the independence number of graphs (Q1946229) (← links)
• On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
• GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
• (Q3381197) (← links)
• (Q3582610) (← links)
• (Q3752410) (← links)
• Rank and chromatic number of a graph (Q4355066) (← links)
• Lower bounds on size and independence inK4-free graphs (Q4362088) (← links)
• Two faces of greedy leaf removal procedure on graphs (Q5132111) (← links)
• New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
• Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
• Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (Q5958808) (← links)