Skip to main content
SpringerLink
Log in

New Cases of Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Triodes

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

A triode is a tree with three leaves and a single vertex of degree \( 3 \). The independent set problem is solvable in polynomial time for graphs that do not contain a triode as a subgraph with any fixed number of vertices. If the induced triode with \( k \) vertices is forbidden, then for \( k>5 \) the complexity of this problem is unknown. We consider intermediate cases where an induced triode with any fixed number of vertices and some of its spanning supergraphs are forbidden. For an arbitrary triode with a fixed vertex number, we prove the solvability of the independent set problem in polynomial time in the following cases:

  1. 1.

    A triode and all its spanning supergraphs with bounded vertex degrees are forbidden.

  2. 2.

    A triode and all its spanning supergraphs having large deficiency (the number of edges in the complementary graph) are forbidden.

  3. 3.

    A triode and all its supergraphs from which this triode can be obtained using the graph intersection operation are forbidden, provided the graph has a vertex of bounded antidegree.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

REFERENCES

  1. V. E. Alekseev and D. V. Korobitsyn, “On the complexity of some problems for hereditary classes of graphs,” Diskretn. Mat. 4 (4), 34–40 (1992) [in Russian].

    MathSciNet  MATH  Google Scholar 

  2. V. E. Alekseev and S. V. Sorochan, “New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths,” Diskretn. Anal. Issled. Oper. 25 (2), 5–18 (2018) [J. Appl. Ind. Math. 12 (2), 213–219 (2018)].

    Article  MathSciNet  MATH  Google Scholar 

  3. V. E. Alekseev, “On the local restriction effect on the complexity of finding the graph independence number,” in Combinatorial-Algebraic Methods in Applied Mathematics (Izd. Gorkovsk. Univ., Gorky, 1982), 3–13 [in Russian].

  4. V. E. Alekseev, “On the number of maximal independent sets in graphs from hereditary classes,” in Combinatorial-Algebraic Methods in Discrete Optimization (Izd. NNGU, Nizhny Novgorod, 1991), 5–8 [in Russian].

  5. V. E. Alekseev, “A polynomial algorithm for finding the largest independent sets in claw-free graphs,” Diskretn. Anal. Issled. Oper. Ser. 1 6 (4), 3–19 (1999) [Discrete Appl. Math. 135 (1–3), 3–16 (2004)].

    MathSciNet  Google Scholar 

  6. V. V. Lozin and R. Mosca, “Independent sets in extension of 2K2-free graphs,” Discrete Appl. Math. 146, 74–80 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  7. D. Lokshantov, M. Vatshelle, and Y. Villanger, “Independent set in \( P_5 \)-free graphs in polynomial time,” Proc. Twenty-Fifth Annu. ACM–SIAM Symp. Discrete Algorithms, SODA 2014 (Portland, Oregon, USA, January 5–7, 2014), 570–581.

  8. A. Grzesik, T. Klimosova, M. Pilipczuk, and M. Pilipczuk, “Polynomial-time algorithm for Maximum Weight Independent Set on \( P_6 \)-free graphs,” 2017. .

  9. T. Karthick and F. Maffray, “Weighted independent sets in classes of \( P_6 \)-free graphs,” Discrete Appl. Math. 209, 217–226 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  10. V. V. Lozin, J. Monnot, and B. Ries, “On the maximum independent set problem in subclasses of subcubic graphs,” J. Discrete Algorithms 31, 104–112 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  11. V. V. Lozin and D. Rautenbach, “Some results on graphs without long induced paths,” Inf. Process. Lett. 88, 167–171 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  12. D. Malyshev and D. Sirotkin, “Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs,” J. Appl. Ind. Math. 11 (3), 400–414 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  13. T. Abrishami, M. Chudnovsky, C. Dibek, and P. Rzaűewski, “Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws,” Proc. 2022 Annu. ACM–SIAM Symp. Discrete Algorithms (SODA) (2022), 1448–1470. https://epubs.siam.org/doi/epdf/10.1137/1.9781611977073.61 .

  14. V. Alekseev, V. V. Lozin, D. Malyshev, M. Milanic, “The maximum independent set problem in planar graphs,” Lect. Notes Comput. Sci. 5162 (4), 96–107 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  15. D. Malyshev, “Classes of subcubic planar graphs for which the independent set problem is polynomially solvable,” J. Appl. Ind. Math. Vol. 7 (4), 537–548 (2013).

    Article  MATH  Google Scholar 

  16. L. Lovász and M. D. Plummer, Matching Theory, vol. 29 of Ann. Discrete Math. (North-Holland, Amsterdam, 1986).

  17. G. Minty, “On maximal independent sets of vertices in claw-free graphs,” J. Combin. Theory. Ser. B 28 (3), 284–304 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  18. N. Sbihi, “Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile,” Discrete Math. 29 (1), 53–76 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  19. V. A. Emelichev et al., Graph Theory Lectures (Nauka, Moscow, 1990) [in Russian].

  20. W. Hsu, Y. Ikura, and G. L. Nemhauser, “A polynomial algorithm for maximum weighted vertex packing in graphs without long odd cycles,” Math. Program. 20, 225–232 (1981).

    Article  MATH  Google Scholar 

Download references

ACKNOWLEDGMENTS

The author is grateful to the referee for valuable comments regarding the review of sources related to the research topic.

Author information

Authors and Affiliations

  1. Lobachevsky State University of Nizhny Novgorod, Nizhny Novgorod, 603022, Russia

    S. V. Sorochan

Authors
  1. S. V. Sorochan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. V. Sorochan.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sorochan, S.V. New Cases of Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Triodes. J. Appl. Ind. Math. 17, 185–198 (2023). https://doi.org/10.1134/S1990478923010210

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation