3 citations · 8 across the 12 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 3 cited
Spanning trees with small degrees and few leaves
Eduardo Rivera-Campo
We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves.
math.CO2012★ 3 cited
A sufficient condition for the existence of plane spanning trees on geometric graphs
Eduardo Rivera-Campo, Virginia Urrutia-Galicia
Let P be a set of n > 2 points in general position in the plane and let G be a geometric graph with vertex set P. If the number of empty triangles uvw in P for which the subgraph o…
math.CO2012
Blockers for non-crossing spanning trees in complete geometric graphs
Chaya Keller, Micha A. Perles, Eduardo Rivera-Campo +1
In this paper we present a complete characterization of the smallest sets that block all the simple spanning trees (SSTs) in a complete geometric graph. We also show that if a subg…