%0 Journal Article
%A K. S. Kobylkin
%T Computational complexity of the vertex cover problem in the class of planar triangulations
%J Trudy Instituta matematiki i mehaniki
%D 2016
%P 153-159
%V 22
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMM_2016_22_3_a14/
%G ru
%F TIMM_2016_22_3_a14