|
|||||
|
|
Classes of subcubic planar graphs for which the independent set problem is polynomially solvable |
|
| Authors: | D. S. Malyshev |
| Affiliation: | 1. National Research University Higher School of Economics at Nizhni Novgorod, B. Pecherskaya ul. 25/12, Nizhni Novgorod, 603155, Russia 2. Nizhni Novgorod State University, ul. Gagarina 23, 603950, Nizhni Novgorod, Russia |
| Abstract: | We prove the polynomial solvability of the independent set problem for some family of classes of the planar subcubic graphs. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |