Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Spanning trees with bounded degrees

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Lets andk be positive integers. We prove that ifG is ak-connected graph containing no independent set withks+2 vertices thenG has a spanning tree with maximum degree at mosts+1. Moreover ifs≥3 and the independence number α(G) is such that α(G)≤1+k(s−1)+c for some0≤c≤k thenG has a spanning tree with no more thanc vertices of degrees+1.

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

Access this article

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.

Similar content being viewed by others

References

  1. V. Chvátal, andP. Erdős: A note on Hamiltonian Paths,Discrete Mathematics,2 (1972), 111–113.

    Google Scholar 

  2. S. Win: On a conjecture of Las Vergnas Concerning Certain Spanning Trees in Graphs,Resultate der Mathematik,2, 215–224.

  3. S. Win: Existenz von Gerüsten mit Vorgeschriebenem Maximalgrad in Graphen,Abhandlungen Aus dem Mathematischen Seminar der Universität Hamburg,43 (1975), 263–267.

    Google Scholar 

  4. M. A. Gurgel, andY. Wakabayashi: Onk-leaf-connected graphs,Journal of Combinatorial Theory, Series B41 (1986), 1–16.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neumann-Lara, V., Rivera-Campo, E. Spanning trees with bounded degrees. Combinatorica 11, 55–61 (1991). https://doi.org/10.1007/BF01375473

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS subject classification (1980)

Keywords

Navigation