Pages that link to "Item:Q2436655"
From MaRDI portal
The following pages link to Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655):
Displayed 12 items.
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← 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)