Skip to main content
SpringerLink
Log in

Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs

Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price includes VAT (Canada)

Instant access to the full article PDF.

Institutional subscriptions

References

  1. V. E. Alekseev, “On Compressible Graphs,” in Problems of Cybernetics, Vol. 36 (Nauka, Moscow, 1979), pp. 23–31.

    Google Scholar 

  2. V. E. Alekseev and V. V. Lozin, “On Local Graph Transformations Preserving Independence Number,” Diskretn. Anal. Issled. Oper. Ser. 1, 5 (1), 3–19 (1998).

    MathSciNet  MATH  Google Scholar 

  3. V. E. Alekseev and D. S. Malyshev, “Planar Graph Classes with the Independent Set Problem Solvable in Polynomial Time,” Diskretn. Anal. Issled. Oper. 15 (1), 3–10 (2008) [J. Appl. Indust. Math. 3 (1), 1–4 (2009)].

    MathSciNet  MATH  Google Scholar 

  4. D. S. Malyshev, “Classes of Subcubic Planar Graphs for Which the Independent Set Problem Is Polynomially Solvable,” Diskretn. Anal. Issled. Oper. 20 (3), 26–44 (2013) [J. Appl. Indust. Math. 7 (4), 537–548 (2013)].

    MathSciNet  MATH  Google Scholar 

  5. V. E. Alekseev, “On Easy and Hard Hereditary Classes of Graphs with Respect to the Independent Set Problem,” Discrete Appl. Math. 132 (1–3), 17–26 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  6. V. E. Alekseev, V. V. Lozin, D. S. Malyshev, and M. Milanič, “The Maximum Independent Set Problem in Planar Graphs,” in Mathematical Foundations of Computer Science 2008: Proceedings of 33rd International Symposium MFCS, Torun´, Poland, August 25–29, 2008 (Springer, Heidelberg, 2008), pp. 96–107.

    Chapter  Google Scholar 

  7. J. E. Hopcroft and R. E. Tarjan, “Efficient Planarity Testing,” J. ACM 21 (4), 549–568 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  8. V. V. Lozin and M. Milanič, “Maximum Independent Sets in Graphs of Low Degree,” in Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, USA, January 7–9, 2007 (SIAM, Philadelphia, PA, 2007), pp. 874–880.

    Google Scholar 

  9. V. V. Lozin and M. Milanič, “On the Maximum Independent Set Problem in Subclasses of Planar Graphs,” J. Graph Algorithms Appl. 14 (2), 269–286 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  10. V. V. Lozin, J. Monnot, and B. Ries, “On the Maximum Independent Set Problemin Subclasses of Subcubic Graphs,” J. Discrete Algorithms 31, 104–112 (2015).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, ul. Bol’shaya Pecherskaya 25/12, Nizhny Novgorod, 603155, Russia

    D. S. Malyshev & D. V. Sirotkin

Authors
  1. D. S. Malyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. V. Sirotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. S. Malyshev.

Additional information

Original Russian Text © D.S. Malyshev, D.V. Sirotkin, 2017, published in Diskretnyi Analiz i Issledovanie Operatsii, 2017, Vol. 24, No. 3, pp. 35–60.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malyshev, D.S., Sirotkin, D.V. Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs. J. Appl. Ind. Math. 11, 400–414 (2017). https://doi.org/10.1134/S1990478917030115

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478917030115

Keywords

search

Navigation