• laceable

laceable (suomeksi)

Määritelmät:

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