Abstract Forty years ago, Kleitman considered the numbers of crossings in good planar drawings of the complete bipartite graph ${K_{m,n}}$. Among other things, he ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback