Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002): Difference between revisions
From MaRDI portal
Latest revision as of 08:41, 30 July 2024
scientific article; zbMATH DE number 6857056
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs |
scientific article; zbMATH DE number 6857056 |
Statements
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (English)
0 references
6 April 2018
0 references
independent set problem
0 references
graph reduction
0 references
efficient algorithm
0 references
0 references
0 references
