Skip to main content
SpringerLink
Log in

König Graphs for 4-Paths: Widened Cycles

  • Conference paper
  • First Online:
Models, Algorithms and Technologies for Network Analysis (NET 2014)

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

Included in the following conference series:

  • 722 Accesses

Abstract

We characterize the graphs whose induced subgraphs all have the following property: The maximum number of induced 4-paths is equal to the minimum cardinality of the set of vertices such that every induced 4-path contains at least one of them. In this chapter we describe all such graphs obtained from simple cycles by replacing some vertices with cographs.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. Alekseev, V.E., Mokeev, D.B.: König graphs with respect to 3-paths. Diskretnyi Analiz i Issledovanie Operatsiy. 19, 3–14 (2012)

    MathSciNet  MATH  Google Scholar 

  2. Deming, R.W.: Independence numbers of graphs—an extension of the König–Egervary theorem. Discret. Math. 27, 23–33 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lovasz, L., Plummer, M.D.: Matching theory. Akadémiai Kiadó, Budapest (1986)

    MATH  Google Scholar 

  4. Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The complexity of Konig subgraph problems and above-guarantee vertex cover. Algorithmica 61, 857–881 (2011)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Heidelberg (1993)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Mokeev, D.: König graphs for 4-paths. In: Batsyn, M.V., Kalyagin, V.A., Pardalos, P.M. (eds.), Models, algorithms and technologies for network analysis, pp. 93–103. Springer, Berlin (2014)

    Google Scholar 

  10. Chvatal, V.: A semi-strong perfect graph conjecture. Ann. Discrete Math. 21, 279–280 (1984)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research is partly supported by LATNA Laboratory, NRU HSE, RF government grant 11.G34.31.0057.

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136, Rodionova Str., Nizhny Novgorod, Russia

    Dmitry Mokeev

Authors
  1. Dmitry Mokeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dmitry Mokeev .

Editor information

Editors and Affiliations

  1. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  2. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Petr A. Koldanov

  3. Department of Industrial and System Engineering, Center for Applied Optimization University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Mokeev, D. (2016). König Graphs for 4-Paths: Widened Cycles. In: Kalyagin, V., Koldanov, P., Pardalos, P. (eds) Models, Algorithms and Technologies for Network Analysis. NET 2014. Springer Proceedings in Mathematics & Statistics, vol 156. Springer, Cham. https://doi.org/10.1007/978-3-319-29608-1_3

Download citation

Publish with us

Policies and ethics

Search

Navigation