Pages that link to "Item:Q4315392"
From MaRDI portal
The following pages link to On the independence number of random cubic graphs (Q4315392):
Displaying 12 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Large independent sets in random regular graphs (Q1034530) (← links)
- Analysis of greedy algorithms on graphs with bounded degrees (Q1417582) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Cubic graphs with small independence ratio (Q1733918) (← links)
- (Q4027168) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- A new proof of the independence ratio of triangle-free cubic graphs (Q5936033) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)