The following pages link to Independence in connected graphs (Q617904):
Displaying 23 items.
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- Connected graphs with a large number of independent sets (Q395637) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- On a lower bound for the connectivity of the independence complex of a graph (Q409373) (← links)
- A way to construct independence equivalent graphs (Q452914) (← 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 lower bound on independence in terms of degrees (Q548268) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- Extremal values of the chromatic number for a given degree sequence (Q2409517) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- Independent systems of representatives in weighted graphs (Q2460628) (← links)
- Independence in function graphs (Q2791981) (← links)
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3 (Q2825489) (← links)
- (Q3474680) (← links)
- Independence and graph homomorphisms graph homomorphisms (Q4271613) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- (Q4686174) (← links)
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- Improving the Caro-Wei bound and applications to Turán stability (Q6611049) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
