Abstract
Let G be a balanced bipartite graph with bipartite sets X, Y. We say that G is Hamilton-biconnected if there is a Hamilton path connecting any vertex ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
