The following pages link to Girth and Independence Ratio (Q3875951):
Displaying 12 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth (Q400363) (← links)
- Induced forests in cubic graphs (Q791532) (← links)
- Graphs with unique maximum independent sets (Q1069954) (← links)
- Computing independent sets in graphs with large girth (Q1183338) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- Cubic graphs with small independence ratio (Q1733918) (← links)
- Large independent sets in regular graphs of large girth (Q2384807) (← links)
- Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach (Q2971608) (← links)
- Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
- A compilation of relations between graph invariants—supplement I (Q3977270) (← links)
- An invariant for minimum triangle-free graphs (Q5197603) (← links)
