哈密尔顿图（Hamilton graph）：含有哈密尔顿圈的图； 半哈密尔顿图（SemiHamilton graph）：含有哈密尔顿路， 但不含有哈密尔顿圈的图； 非哈密尔顿图（nonHa...
基于28个网页-相关网页
hamilton-graph 奇树孪生性
directed Hamilton graph 有向哈密尔顿图
fractional Hamilton graph 分数哈密顿图
Hamilton-connected graph Hamilton连通图
Almost-Hamilton-Connected graph 几乎Hamilton
hamilton s graph hamilton图
hamilton ' s graph hamilton图
1-Hamilton connected graph Hamilton连通图
Wojcicka supposed that all 3-connected, domination 4-edge-critical graphs were Hamilton graph. She also supposed that all (k-1)connected, domination k-edge-critical graphs were Hamilton graph.
Wojcicka猜想所有3连通，4支配边临界的图都是哈密顿图，并进一步猜想(k-1)连通的，k支配边临界的图都是哈密顿图。
参考来源 - K支配边临界图的哈密顿性和最小边数·2,447,543篇论文数据，部分数据来源于NoteExpress
This paper mainly concerns the properties of Hamilton graph and some methods of judgment based on them.
本文探讨了哈密顿图的性质，并根据这些性质给出了若干种判定非哈密顿图的方法。
By using Hamilton graph, the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。
Being familiar with the Graph Theory, I immediately found the way to solve the problems by seeking the best Hamilton circuit line.
由于对图论知识很熟悉，我很快将问题转化为寻找最佳Hamilton回路。
应用推荐