Abstract
Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susc......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
