Author:
Sirotkin Dmitrii V.,Malyshev Dmitriy S.
Abstract
Abstract
The independent set problem for a given simple graph is to determine the size of a maximal set of its pairwise non-adjacent vertices. We propose a new way of graph reduction leading to a new proof of the NP-completeness of the independent set problem in the class of planar graphs and to the proof of NP-completeness of this problem in the class of planar graphs having only triangular internal facets of maximal vertex degree 18.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. “Classes of subcubic planar graphs for which the independent set problem is polynomially solvable”;J. Appl. Industr. Math.,2013
2. “Computational complexity of the vertex cover problem in the class of planar triangulations”;Trudy in-ta matem. i mekh. UrO RAN,2016
3. “On local graph transformations, preserving the independence number”;Diskretnyy analiz i issledovanie operatsiy,1998
4. “On the maximum independent set problem in subclasses of planar graphs”;J. Graph Algor. Appl.,2010
5. “Some simplified NP-complete graph problems”;Theor. Comput. Sci.,1976