最終更新日：2024/08/04

(graph theory) Of a bipartite graph: having a possible Hamiltonian path between any two vertices from different partite sets.

正解を見る

laceable

問題を編集する

元となった辞書の項目

laceable

adj

(graph theory) Of a bipartite graph: having a possible Hamiltonian path between any two vertices from different partite sets.

These shoes are laceable.

意味（1）

(graph theory) Of a bipartite graph: having a possible Hamiltonian path between any two vertices from different partite sets.