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 14 items.
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- 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)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← 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)
- On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs (Q2870037) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q5146864) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)
- Maximum independent sets in subcubic graphs: new results (Q5919020) (← links)
