Not every 2-tough graph is Hamiltonian
- 作者D. Bauer; H.J. Broersma; H.J. Veldman
- 卷第99卷
- 印刷ISSN0166-218X
- 文件大小80.61KB
- 发表时间2000
- DOI10.1016/s0166-218x(99)00141-9
- 页码317-321
同作者推荐
Steiner minimal trees in Lp2Dietmar Cieslik; Johann Linhart · 1996
Connecting Networks of Minimal CostDietmar Cieslik · 2006
[Combinatorial Optimization] The Steiner Ratio Volume 10 ||Cieslik, Dietmar · 2001
The vertex degrees of minimum spanning treesDietmar Cieslik · 2000
The Steiner ratio of several discrete metric spacesDietmar Cieslik · 2003
[Nonconvex Optimization and Its Applications] Steiner Minimal Trees Volume 23 ||Cieslik, Dietmar · 1998
The Steiner ratio of high-dimensional Banach–Minkowski spacesDietmar Cieslik · 2004