• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Polynomial-Time Solvability of the Independent Set Problem in a Certain Class of Subcubic Planar Graphs

Journal of Applied and Industrial Mathematics. 2017. Vol. 24. No. 3. P. 35-60.
Malyshev D., Sirotkin D.

The independent set problem for a given simple graph consists in computing the size of a largest subset of its pairwise nonadjacent vertices. In this article, we prove the polynomial solvability of the problem for the subcubic planar graphs with no induced tree obtained by identifying the ends of three paths of lengths 3, 3, and 2 respectively.