A diameter-revealing proof of the Bondy-Lovász lemma

Hyung Chan An, Robert Kleinberg

Research output: Contribution to journalArticlepeer-review

Abstract

We present a strengthened version of a lemma due to Bondy and Lovász. This lemma establishes the connectivity of a certain graph whose nodes correspond to the spanning trees of a 2-vertex-connected graph, and implies the k=2 case of the Győri-Lovász 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.

Original languageEnglish
Article number106194
JournalInformation Processing Letters
Volume174
DOIs
Publication statusPublished - 2022 Mar

Bibliographical note

Publisher Copyright:
© 2021 Elsevier B.V.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'A diameter-revealing proof of the Bondy-Lovász lemma'. Together they form a unique fingerprint.

Cite this