Pages that link to "Item:Q2346341"
From MaRDI portal
The following pages link to The maximum independent set problem in subclasses of subcubic graphs (Q2346341):
Displaying 6 items.
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
