搜索结果: 1-2 共查到“运筹学 Hamilton cycles”相关记录2条 . 查询时间(0.281 秒)
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-co...
The Hamilton-Waterloo problem for Hamilton cycles and C4k-factors
2-factorization Hamilton-Waterloo problem Hamilton cycle cycle decompositions
2010/11/30
In this paper we give a complete solution to the Hamilton-Waterloo problem for the case of Hamilton cycles and C4k-factors for all positive integers k.