An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders...
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...