Abstract
An edge of a graph G is called an anti-forcing edge (or forcing single edge) if G has a unique perfect matching not containing this edge. It has been ......
小提示:本篇文献需要登录阅读全文,点击跳转登录