Search
Now showing items 1-2 of 2
Presentation
Witness-Bar Visibility Graphs
(Instituto de Matemáticas de la UNAM, 2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...
Article
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 ...