The following pages link to (Q3115672):
Displaying 8 items.
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- A method of graph reduction and its applications (Q1669583) (← links)
- Independent sets in graphs without subtrees with many leaves (Q3186851) (← links)
- (Q5263782) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002) (← links)
- (Q5875555) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)
