Spanning Trees with Many Leaves 1

@inproceedings{Kleitman2014SpanningTW,
  title={Spanning Trees with Many Leaves 1},
  author={Daniel J. Kleitman and Douglas B. West},
  year={2014}
}
A connected graph having large minimum v ertex degree must ha ve a spanning tree with man y leaves. Inparticular, let l(n, k) be the maximum inte ger m such that e very connectedn-vertex graph with minimum degree at least k has a spanning tree with at leastm leaves. Thenl(n, 3) ≥ n/4 + 2, l(n, 4) ≥ (2n + 8) /5, andl(n, k) ≤ n − 3n/(k +1) + 2 for all k. The lower bounds are proved by an algorithm that constructs a spanning tree with at least the desired number of lea ves. Finally, l(n, k) ≥ (1… CONTINUE READING
2 Citations
6 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Construction of spanning trees with man y leaves

  • J. R. Griggs, M.-S. Wu
  • presented at xxth Southeastern Conf. on Graph…
  • 1989
2 Excerpts

Shastri , Spanning trees with many leaves in cubic graphs

  • D. J. Kleitman, A.
  • Manuscript
  • 1988

Similar Papers

Loading similar papers…