Skip to main content
SpringerLink
Log in

Matching for Graphs of Bounded Degree

  • Conference paper
Frontiers in Algorithmics (FAW 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5059))

Included in the following conference series:

Abstract

We show that there exists a matching with \(\frac{4m}{5k+3}\) edges in a graph of degree k and m edges.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Biedl, T., Demaine, E., Duncan, C., Fleischer, R., Kobourov, S.: Tight bounds on the maximal and maximum matchings. Discrete Math. 285(1-3), 7–15 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Feng, W., Qu, W., Wang, H.: Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. In: Proc. 2007 Int. Conf. on Foundations of Computer Science, Las Vegas, pp. 110–113 (2007)

    Google Scholar 

  3. König, D.: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77, 453–456 (1916)

    Article  MathSciNet  MATH  Google Scholar 

  4. Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28(3), 255–267 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Petersen, J.: Die Theorie der regulären graphs (The theory of regular graphs). Acta Math. 15, 193–220 (1891)

    Article  MathSciNet  Google Scholar 

  6. Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. 22, 107–111 (1947)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Engineering, University of Missouri at Kansas City, Kansas City, MO 64110, USA

    Yijie Han

Authors
  1. Yijie Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franco P. Preparata Xiaodong Wu Jianping Yin

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, Y. (2008). Matching for Graphs of Bounded Degree. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69311-6_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69310-9

  • Online ISBN: 978-3-540-69311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation