Pages that link to "Item:Q5937455"
From MaRDI portal
The following pages link to On the independence number of a graph in terms of order and size (Q5937455):
Displaying 10 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)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- The robustness of resolvable block designs against the loss of whole blocks or replicates (Q496474) (← links)
- Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
- A lower bound on independence in terms of degrees (Q548268) (← links)
- Independence in connected graphs (Q617904) (← links)
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph (Q724735) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
