Skip to main content
SpringerLink
Log in

König Graphs for 4-Paths

  • Conference paper
  • First Online:
Book cover Models, Algorithms and Technologies for Network Analysis

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

Abstract

We give characterization of the graphs, whose each induced subgraph has the property: the maximum number of induced 4-paths is equal to the minimum cardinality of the set of vertices such as every induced 4-path contains at least one of them.

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. Alekseev, V.E., Mokeev, D.B.: König graphs with respect to 3-paths. Diskretnyi Analiz i Issledovanie Operatsiy 19, 3–14 (2012)

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. 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 

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

    Book  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    MATH  Google Scholar 

  7. 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  Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136, Rodionova Str., N.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 Networks Analysis, Department of Applied Mathematics and Informatics, National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Mikhail V. Batsyn

  2. Laboratory of Algorithms and Technologies for Networks Analysis, Department of Applied Mathematics and Informatics, National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  3. Laboratory of Algorithms and Technologies for Networks Analysis, Department of Industrial and Systems Engineering, Center for Applied Optimization, National Research University Higher School of Economics, Nizhny Novgorod, Russia, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Mokeev, D. (2014). König Graphs for 4-Paths. In: Batsyn, M., Kalyagin, V., Pardalos, P. (eds) Models, Algorithms and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics, vol 104. Springer, Cham. https://doi.org/10.1007/978-3-319-09758-9_8

Download citation

Publish with us

Policies and ethics

Search

Navigation