1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
Conditions on the regularity of balanced -partite tournaments for the existence of strong subtournaments with high minimum degree
Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Mika Olsen
We consider the following problem posed by Volkmann in 2007: How close to regular must a c-partite tournament be, to secure a strongly connected subtournament of order ? We give…
Decomposition of balanced multipartite tournaments into strongly connected tournaments
A. P. Figueroa, J. J. Montellano-Ballesteros, M. Olsen
Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and commu…
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…