3 citations · 8 across the 12 of their papers we have counts for
12 papers
Partitions of complete twisted graphs into plane spanning trees
Ana Paulina Figueroa, Eduardo Rivera-Campo
We characterize all partitions of the complete twisted graph into plane spanning trees. In the case of partitions of into isomorphic plane spanning trees, we show…
A note on maximal plane subgraphs of the complete twisted graph containing perfect matchings
Elsa Omaña-Pulido, Eduardo Rivera-Campo
The twisted graph is a drawing of the complete graph with vertices in which two edges () and () cross if…
Convex polygons and separation of convex sets
Eduardo Rivera-Campo, Jorge Urrutia
We prove that for any collection F of pairwise disjoint compact convex sets in the plane there is a pair of sets A and B in F such that any line that separates A from B s…
On the number of heterochromatic trees in nice and beautiful colourings of complete graphs
Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Ricardo Strausz
We introduce classes of edge-colourings of the complete graph -- that we call nice and beautiful -- and study how many heterochromatic spanning trees appear under such colourings.…
A note on spanning trees with a specified degree sequence
María Elena Martínez-Cuero, Eduardo Rivera-Campo
We give an Ore-Type condition sufficient for a graph G to have a spanning tree with a specified degree sequence.
On contractible edges in convex decompositions
Ferran Hurtado, Eduardo Rivera-Campo
Let be a convex decomposition of a set of points in general position in the plane. If consists of more than one polygon, then either contains a deletable…
On heterochromatic out-directed spanning trees in tournaments
Juan José Montellano-Ballesteros, Eduardo Rivera Campo
Given a tournament T, let h(T) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair…
A counterexample to a result on the tree graph of a graph
Ana Paulina Figueroa, Eduardo Rivera-Campo
Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if…
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.
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…
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…
On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
Juan José Montellano-Ballesteros, Eduardo Rivera-Campo
The heterochromatic number hc(H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hypered…