Abstract
It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two o......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
