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

DOI10.1016/j.ipl.2021.106194OpenAlexW3194061904WikidataQ124818246 ScholiaQ124818246MaRDI QIDQ2059880

Hyung-Chan An, Robert D. Kleinberg

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.6561

zbMATH Keywords

graph partitioninggraph algorithmsgraph diameterBondy-Lovász lemmaGyőri-Lovász theorem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• st-ordering the vertices of biconnected graphs
• Computing an st-numbering
• Communication in m-connected graphs
• (Almost) Tight bounds and existence theorems for single-commodity confluent flows
• A homology theory for spanning tress of a graph
• Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A diameter-revealing proof of the Bondy-Lovász lemma