Pages that link to "Item:Q2980912"
From MaRDI portal
The following pages link to Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912):
Displayed 4 items.
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)