Geodesic
Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 3, pp. 26-44

Voir la notice de l'article provenant de la source Math-Net.Ru

Polynomial-time solvability of the independent set problem for some subclasses of subcubic planar graphs is proved. Bibliogr. 5.
Keywords: independent set problem, boundary class, computational complexity, effective algorithm. 
@article{DA_2013_20_3_a1,
     author = {D. S. Malyshev},
     title = {{\CYRS}lasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {26--44},
     publisher = {mathdoc},
     volume = {20},
     number = {3},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_3_a1/}
}
TY  - JOUR
AU  - D. S. Malyshev
TI  - Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 26
EP  - 44
VL  - 20
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_3_a1/
LA  - ru
ID  - DA_2013_20_3_a1
ER  - 
%0 Journal Article
%A D. S. Malyshev
%T Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 26-44
%V 20
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_3_a1/
%G ru
%F DA_2013_20_3_a1
D. S. Malyshev. Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 3, pp. 26-44. http://geodesic.mathdoc.fr/item/DA_2013_20_3_a1/