Skip to main content
Springer Nature Link
Log in

Tighter Bounds on the Size of a Maximum P 3-Matching in a Cubic Graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We establish that for any connected cubic graph G of order n > 16 the maximum P 3-matching in G consists of at least \(\frac{117}{152}n\) vertices.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akiyama, J., Kano, M.: Factors and factorizations of graphs—a survey. Journal of Graph Theory 9, 1–42 (1985)

    Google Scholar 

  2. Hell, P., Kirkpatrick, D.G.: On the complexity of general graph factor problems. SIAM Journal on Computing 12, 601–609 (1983)

    Google Scholar 

  3. Kawarabayashi, K., Matsuda, H., Oda, Y., Ota, K.: Path factors in cubic graphs. Journal of Graph Theory 39, 188–193 (2002)

    Google Scholar 

  4. Kelmans, A.: Packing k-edge trees in graphs of restricted degrees. Journal of Graph Theory 55, 306–324 (2007)

    Google Scholar 

  5. Kelmans, A., Mubayi, D.: How many disjoint 2-edge paths must a cubic graph have? Journal of Graph Theory 45, 57–79 (2004)

    Google Scholar 

  6. Kosowski, A., Małafiejski, M., Żyliński, P.: An Approximation Algorithm for Maximum P 3-packing in Subcubic Graphs. Information Processing Letters 99, 230–233 (2006)

    Google Scholar 

  7. Kosowski, A., Żyliński, P.: Packing three-vertex paths in 2-connected cubic graphs. To appear in: Ars Combinatoria 89 (2008)

Download references

Author information

Authors and Affiliations

  1. Department of Algorithms and System Modelling, Gdańsk University of Technology, Narutowicza 11/12, 80952, Gdańsk, Poland

    Adrian Kosowski & Michał Małafiejski

  2. Institute of Computer Science, University of Gdańsk, Wita Stwosza 57, 80952, Gdańsk, Poland

    Paweł Żyliński

Authors
  1. Adrian Kosowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michał Małafiejski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Żyliński
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kosowski, A., Małafiejski, M. & Żyliński, P. Tighter Bounds on the Size of a Maximum P 3-Matching in a Cubic Graph. Graphs and Combinatorics 24, 461–468 (2008). https://doi.org/10.1007/s00373-008-0807-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-008-0807-7

Keywords