Pages that link to "Item:Q3599118"
From MaRDI portal
The following pages link to The Maximum Independent Set Problem in Planar Graphs (Q3599118):
Displaying 13 items.
- On integer programming with bounded determinants (Q315478) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812) (← links)
- Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms (Q4210143) (← links)
- The Vertex-Disjoint Menger Problem in Planar Graphs (Q4337639) (← links)
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002) (← links)
- New cases of polynomial solvability of the independent set problem for graphs with forbidden triods (Q6078549) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)
