「Hamiltonian」の共起表現一覧(1語右が「cycle」)
該当件数 : 17件
| A | Hamiltonian cycle in a dodecahedron. |
| h it is maximally nonhamiltonian: it has no | Hamiltonian cycle, but any two vertices can be connecte |
| that a strongly connected tournament has a | Hamiltonian cycle (Camion 1959). |
| Let G be a finite planar graph with a | Hamiltonian cycle C. |
| ntries are absent above if the graph has no | Hamiltonian cycle, which is rare (A164919). |
| r instance, suppose one is given as input a | Hamiltonian cycle in a cubic graph; it follows from Smi |
| "Every 3-connected planar cubic graph has a | Hamiltonian cycle (along the edges) through all its ver |
| raph is a subgraph of a planar graph with a | Hamiltonian cycle; for instance, the Goldner-Harary gra |
| x is incident to exactly three edges) has a | Hamiltonian cycle, but this conjecture was disproved by |
| ices, the Herschel graph does not contain a | Hamiltonian cycle (a cycle of edges that passes through |
| The game's object is finding a | Hamiltonian cycle along the edges of a dodecahedron suc |
| ragment is part of a larger graph, then any | Hamiltonian cycle through the graph must go in or out o |
| bipartite cubic polyhedron, there exists a | Hamiltonian cycle that contains e but does not contain |
| If G has a | Hamiltonian cycle, then the square of G (the graph on t |
| ree vertices on the other side; because any | Hamiltonian cycle would have to alternate between the t |
| Gomory's theorem can be proven using a | Hamiltonian cycle of the grid graph formed by the chess |
| ings in a graph formed by removing a single | Hamiltonian cycle from a complete bipartite graph; the |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
