Buscar
Mostrando ítems 1-2 de 2
Artículo
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. ...