Abstract
Given a graph H, a path P of length at least two is called an H-path if P meets H exactly in its ends. A graph G is a ring graph if each block of G wh......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
