Skip to main content
SpringerLink
Log in

On Forbidden Induced Subgraphs for the Class of Triangle-König Graphs

  • Conference paper
  • First Online:
Computational Aspects and Applications in Large-Scale Networks (NET 2016)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 247))

Included in the following conference series:

  • 459 Accesses

Abstract

A triangle packing of graph G is a set of pairwise vertex-disjoint 3-vertex cycles in G. A triangle vertex cover of graph G is a subset S of vertices of G such that every cycle of 3 vertices in G contains at least one vertex from S. We consider a hereditary class graphs which has the following property. The maximum cardinality of a triangle packing is equal to the minimum cardinality of a triangle vertex cover. In this paper we present some minimal forbidden induced subgraphs for this hereditary class.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdelsadek, Y., Herrmann, F., Kacem, I., Otjacques, B.: Branch-and-bound algorithm for the maximum triangle packing problem. Comput. Indus. Eng. 81, 147–157 (2015)

    Article  Google Scholar 

  2. Alekseev, V.E., Mokeev, D.B.: König graphs with respect to 3-paths. Diskretnyi Analiz i Issledovanie Operatsii. 19, 3–14 (2012)

    MathSciNet  MATH  Google Scholar 

  3. Alekseev, V.E., Mokeev, D.B.: König graphs for 3-paths and 3-cycles. Discrete Appl. Math. 204, 1–5 (2016)

    Article  MathSciNet  Google Scholar 

  4. Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25, 272–289 (1996)

    Article  MathSciNet  Google Scholar 

  5. Caprara, A., Rizzi, R.: Packing triangles in bounded degree graphs. Inform. Proc. Lett. 84(4), 175–180 (2002)

    Article  MathSciNet  Google Scholar 

  6. Cornuéjols, G.: Combinatorial Optimization: Packing and Covering. Society for Industrial and Applied Mathematics, Philadelphia (2001)

    Book  Google Scholar 

  7. Ding, G., Xu, Z., Zang, W.: Packing cycles in graphs II. J. Comb. Theory. Ser. B. 87, 244–253 (2003)

    Article  MathSciNet  Google Scholar 

  8. Edmonds, J.: Paths, trees, and flowers. Canadian J. Math. 17(3–4), 449–467 (1965)

    Article  MathSciNet  Google Scholar 

  9. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Heidelberg (1993)

    Book  Google Scholar 

  10. Guruswami, V., Rangan, C.P., Chang, M.S., Chang, G.J., Wong, C.K.: The \(K_r\)-packing problem. Computing 66(1), 79–89 (2001)

    Article  MathSciNet  Google Scholar 

  11. Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Appl. Math. 154(6), 971–979 (2006)

    Article  MathSciNet  Google Scholar 

  12. Hell, P.: Graph packing. Electron. Notes Discrete Math. 5, 170–173 (2000)

    Article  MathSciNet  Google Scholar 

  13. Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: Proceedings of the Tenth Annual ACM Symposium on Theory of computing (San Diego, May 1–3), pp. 240–245. ACM, New York (1978)

    Google Scholar 

  14. Kloks, T., Poon, S.H.: Some results on triangle partitions. In: arXiv preprint (2011) Available via DIALOG. https://arxiv.org/abs/1104.3919v1 Cited 25 Aug 2017

  15. Korpelainen, N., Lozin, V.V., Malyshev, D., Tiskin, A.: Boundary properties of graphs for algorithmic graph problems. Theor. Comp. Sci. 412, 3545–3554 (2011)

    Article  MathSciNet  Google Scholar 

  16. Malyshev, D.: On the infinity of the set of boundary classes for the 3-edge-colorability problem. J. Appl. Indus. Math. 4(2), 213–217 (2010)

    Article  Google Scholar 

  17. Malyshev, D.: On the number of boundary classes in the 3-colouring problem. Discrete Math. Appl. 19(6), 625–630 (2010)

    MATH  Google Scholar 

  18. Malyshev, D.S.: The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem. Discrete Math. Appl. 23(3–4), 245–249 (2013)

    MathSciNet  MATH  Google Scholar 

  19. Malyshev, D.: A study of the boundary graph classes for colorability problems. J. Appl. Indus. Math. 7(2), 221–228 (2013)

    Article  Google Scholar 

  20. Malyshev, D.: Classes of graphs critical for the edge list-ranking problem. J. Appl. Indus. Math. 8(2), 245–255 (2014)

    Article  Google Scholar 

  21. Malyshev, D., Pardalos, P.M.: Critical hereditary graph classes: a survey. Optim. Lett. 10(8), 1593–1612 (2016)

    Article  MathSciNet  Google Scholar 

  22. Manić, G., Wakabayashi, Y.: Packing triangles in low degree graphs and indifference graphs. Discrete Math. 308(8), 1455–1471 (2008)

    Article  MathSciNet  Google Scholar 

  23. Mokeev, D.B.: König graphs for 4-paths. Models, algorithms and technologies for network analysis, vol. 104, pp. 93–103. Springer, Heidelberg (2014)

    Google Scholar 

  24. Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Comput. Sci. Rev. 1, 12–26 (2007)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the Russian Science Foundation Grant No. 17-11-01336.

Author information

Authors and Affiliations

  1. Department of Algebra, Geometry and Discrete Mathematics, Lobachevsky State University of Nizhni Novgorod, 23, Gagarina Ave., N.Novgorod, Russia

    Dmitry B. Mokeev

  2. Laboratory of Algorithms and Technologies for Networks Analysis, Higher School of Economics in Nizhni Novgorod, 136, Rodionova Str., N.Novgorod, Russia

    Dmitry B. Mokeev

Authors
  1. Dmitry B. Mokeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dmitry B. Mokeev .

Editor information

Editors and Affiliations

  1. Higher School of Economics, National Research University, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  3. Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania, USA

    Oleg Prokopyev

  4. Higher School of Economics, National Research University, Nizhny Novgorod, Russia

    Irina Utkina

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mokeev, D.B. (2018). On Forbidden Induced Subgraphs for the Class of Triangle-König Graphs. In: Kalyagin, V., Pardalos, P., Prokopyev, O., Utkina, I. (eds) Computational Aspects and Applications in Large-Scale Networks. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 247. Springer, Cham. https://doi.org/10.1007/978-3-319-96247-4_4

Download citation

Publish with us

Policies and ethics

Search

Navigation