Skip to main content
SpringerLink
Log in

A Note on Matchings and Spanning Trees with Bounded Degrees

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

If M is a perfect matching in a k-connected graph G with independence number \(\alpha \le 1 + {3 \over 2}k\), then M can be extended to a spanning tree of G with maximum degree at most three.

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

Access this article

Log in via an institution

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. Bondy, J.A., Murty, U.S.R.: Graph theory with applications, North Holland, New York, 1981

    Google Scholar 

  2. Chvátal, V., Erdös, P.: A Note on hamiltonian circuits, Discrete Math. 2, 111–113 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  3. Neumann-Lara, V., Rivera-Campo, E.: Spanning trees with bounded degrees, Combinatorica 11(1), 55–61 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Universidad Autónoma Metropolitana-I, Apto. 55-534, México D.F., 09340, Mexico

    Eduardo Rivera-Campo

Authors
  1. Eduardo Rivera-Campo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eduardo Rivera-Campo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rivera-Campo, E. A Note on Matchings and Spanning Trees with Bounded Degrees. Graphs and Combinatorics 13, 159–165 (1997). https://doi.org/10.1007/BF03352993

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03352993

Keywords

Search

Navigation