Abstract
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to s......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
