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 ...
This is a preview. Log in through your library . Abstract This paper investigates the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback