Pages that link to "Item:Q5374002"
From MaRDI portal
The following pages link to Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002):
Displaying 9 items.
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812) (← links)
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639) (← links)
- New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths (Q4558286) (← links)
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055) (← links)
- (Q5263782) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)
- (Q5875555) (← links)
- New cases of polynomial solvability of the independent set problem for graphs with forbidden triods (Q6078549) (← links)