Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2010: Algorithms – ESA 2010 pp 112–122Cite as

Induced Matchings in Subcubic Planar Graphs

  • Conference paper

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

Abstract

We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discrete Math. 108(1-3), 231–252 (1992); Topological, algebraical and combinatorial structures. Frolík’s memorial volume

    Article  MATH  MathSciNet  Google Scholar 

  2. Balakrishnan, H., Barrett, C.L., Kumar, V.S.A., Marathe, M.V., Thite, S.: The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 22(6), 1069–1079 (2004)

    Article  Google Scholar 

  3. Chung, F.R.K., Gyárfás, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in 2K 2-free graphs of bounded degree. Discrete Math. 81(2), 129–135 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1), 79–91 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Erman, R., Kowalik, L., Krnc, M., Walen, T.: Improved induced matchings in sparse graphs. In: IWPEC, pp. 134–148 (2009)

    Google Scholar 

  6. Faudree, R.J., Gyárfás, A., Schelp, R.H., Tuza, Z.: Induced matchings in bipartite graphs. Discrete Math. 78(1-2), 83–87 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Faudree, R.J., Schelp, R.H., Gyárfás, A., Tuza, Z.: The strong chromatic index of graphs. Ars Combin. 29(B), 205–211 (1990); The 12th BCC (Norwich, 1989)

    MathSciNet  Google Scholar 

  8. Horák, P., He, Q., Trotter, W.T.: Induced matchings in cubic graphs. J. Graph Theory 17(2), 151–160 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kanj, I.A., Pelsmajer, M.J., Xia, G., Schaefer, M.: On the induced matching problem. In: STACS, pp. 397–408 (2008)

    Google Scholar 

  10. Lozin, V.V.: On maximum induced matchings in bipartite graphs. Inform. Process. Lett. 81(1), 7–11 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mehlhorn, K., Sanders, P.: Algorithms and data structures. Springer, Berlin (2008)

    MATH  Google Scholar 

  12. Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discrete Appl. Math. 157(4), 715–727 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2), 181–190 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)

    MATH  Google Scholar 

  15. Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inform. Process. Lett. 15(1), 14–19 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wegner, G.: Graphs with given diameter and a coloring problem. Technical report, Institut für Mathematik, Universität Dortmund (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Durham University, Durham, United Kingdom

    Ross J. Kang

  2. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Matthias Mnich

  3. Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands

    Tobias Müller

Authors
  1. Ross J. Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Mnich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tobias Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, TU Eindhoven, Eindhoven, The Netherlands

    Mark de Berg

  2. Institute for Computer Science, J.W. Goethe University, 60325, Frankfurt/Main, Germany

    Ulrich Meyer

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, R.J., Mnich, M., Müller, T. (2010). Induced Matchings in Subcubic Planar Graphs. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15781-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15781-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15780-6

  • Online ISBN: 978-3-642-15781-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation