机译:L Hamiltonicity,Hamiltonian连接,最长(S,T)-Path的L形超级图
Kohjerdi is with the Department of Mathematics & Computer Science Shahed University Tehran Iran;
Department of Computer Science and Information Engineering Chaoyang University of Technology Wufeng Taichung 413310 Taiwan;
Hamiltonicity; Hamiltonian connectivity; longest (s, t)-path; solid supergrid graphs; L-shaped supergrid graphs; computer embroidery machines; 3D printers;
机译:某些形状超网格图的哈密顿性和哈密顿连通性
机译:字母上级图的汉密尔顿连接
机译:矩形超级图形的Hamiltonian连接
机译:一些字母超网格图的哈密顿连通性
机译:距离彩色图中的汉密尔顿性和连通性。
机译:用细菌计算机解决哈密顿路径问题
机译:图中的哈密顿路径和哈密尔顿连通性