Toughness and binding number.

D. Bauer,N. Kahl,E. Schmeichel,D. R. Woodall,M. Yatauro

Discrete Applied Mathematics（2014）

引用 4|浏览2

暂无评分

摘要

Let @t(G) and bind(G) be the toughness and binding number, respectively, of a graph G. Woodall observed in 1973 that @t(G)=bind(G)-1. In this paper, we obtain best possible improvements of this inequality except when (1+5)/2

查看译文

关键词

graph g. woodall,binding number,possible improvement,toughness

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要