Spanning Trees with Few Leaves

@article{Tsugaki2007SpanningTW,
  title={Spanning Trees with Few Leaves},
  author={Masao Tsugaki and Tomoki Yamashita},
  journal={Graphs and Combinatorics},
  year={2007},
  volume={23},
  pages={585-598}
}
In this paper, we prove that an m-connected graph G on n vertices has a spanning tree with at most k leaves (for k ≥ 2 and m ≥ 1) if every independent set of G with cardinality m+k contains at least one pair of vertices with degree sum at least n−k+1. This is a common generalization of results due to Broersma and Tuinstra and to Win. 

From This Paper

Figures, tables, and topics from this paper.

References

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

On a conjecture of Las Vergnas concerning certain spanning trees in graphs, Resultate Math

  • S. Win
  • 2, 215–224
  • 1979
Highly Influential
2 Excerpts

Basic Graph Theory: Paths and Circuits

  • J. A. Bondy
  • in: Handbook of Combinatorics,
  • 1995
1 Excerpt

On a conjecture of Las Vergnas concerning certain spanning trees in graphs

  • S. Win
  • Resultate Math
  • 1979

Note on Hamilton circuits

  • O. Ore
  • Am . Math . Monthly
  • 1960

Note on Hamilton circuits, Am

  • O. Ore
  • Math. Monthly 67, 55
  • 1960
1 Excerpt

Similar Papers

Loading similar papers…