期刊文献+

THE HAMILTONIAN CYCLES OF 1-TOUGH GRAPHS

THE HAMILTONIAN CYCLES OF 1-TOUGH GRAPHS
原文传递
导出
摘要 Let G be a graph and t a real number such that the implication k(G-S)】1 |S|≥t·k(G-S) holds for each set S of points of G. Then G will be said to be t-tough. Here k(G-S) is the number of components of G-S. Obviously, a 1-tough graph
作者 田永成
出处 《Chinese Science Bulletin》 SCIE EI CAS 1991年第3期262-262,共1页
关键词 TOUGH IMPLICATION holds
  • 引文网络
  • 相关文献
;
使用帮助 返回顶部