The following pages link to (Q5263782):
Displaying 4 items.
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)
- Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)