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

Information Processing Letters（2022）

引用 0|浏览38

暂无评分

摘要

•The Bondy-Lovász lemma is strengthened with an upper bound on the graph diameter.•A constructive proof shows the upper bound on the graph diameter.•Explicit instances yield a lower bound that asymptotically matches the upper bound.

查看译文

关键词

Bondy-Lovász lemma,Győri-Lovász Theorem,Graph diameter,Graph partitioning,Graph algorithms

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要