Pages that link to "Item:Q3834072"
From MaRDI portal
The following pages link to The maximum independent set problem for cubic planar graphs (Q3834072):
Displaying 12 items.
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- Facets for node packing (Q1278997) (← links)
- The maximum clique problem (Q1318271) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- On independent domination in planar cubic graphs (Q2312063) (← links)
- The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
- Independent sets in triangle-free cubic planar graphs (Q2490253) (← links)
- On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs (Q2870037) (← links)
- An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)