Abstract
A permutation snark is a cubic graph which has a 2-factor consisting of two chordless cycles and is not 3-edge-colourable. Every permutation snark is ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
