A Diameter-Revealing Proof of the Bondy-Lovász Lemma

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 1 figures

Scientific paper

We present a strengthened version of a lemma due to Bondy and Lov\'asz. This lemma establishes the connectivity of a certain graph whose nodes correpond to the spanning trees of a 2-vertex-connected graph, and implies the k=2 case of the Gy\H{o}ri-Lov\'asz Theorem on partitioning of k-vertex-connected graphs. Our strengthened version constructively proves an asymptotically tight O(|V|^2) bound on the worst-case diameter of this graph of spanning trees.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Diameter-Revealing Proof of the Bondy-Lovász Lemma does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Diameter-Revealing Proof of the Bondy-Lovász Lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Diameter-Revealing Proof of the Bondy-Lovász Lemma will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-68462

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.