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 ...

Recently, Knuth and Ciucu independently proved the surprising fact, conjectured by Stanley, that one connected component of the tensor product of a path with itself (the so-called "Aztec diamond graph ...

Let us say that a graph is k-apex if it contains a set of at most k vertices whose removal yields a planar graph. We define the apex number of a graph G as the minimum k for which G is k-apex. It is ...