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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback