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

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

2011-11-28

arxiv.org/abs/1111.6561v1

Computer Science

Discrete Mathematics

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.

Affiliated with

Also associated with

No associations

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

Comments { 0 }

Profile ID: LFWR-SCP-O-68462