Abstract
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with n......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
