Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816)
From MaRDI portal
scientific article; zbMATH DE number 6460050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classes of subcubic planar graphs for which the independent set problem is polynomially solvable |
scientific article; zbMATH DE number 6460050 |
Statements
Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (English)
0 references
17 July 2015
0 references
independent set problem
0 references
boundary class
0 references
computational complexity
0 references
efficient algorithm
0 references
