加载中…
2010-08-16
On the Orchard crossing number of complete bipartite graphs
Elie FederDavid Garber
文献摘要
We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本