activity
20152026
most citedConditions on the regularity of balanced -partite tournaments for the existence of strong subtournaments with high minimum degree

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

math.DS2026

Extinction thresholds in a graph-based model of HIV infection dynamics

Manuel A. Espinosa-García, Ana Paulina Figueroa, Julián A. Fresán-Figueroa +2

We study a graph-based cellular automaton for HIV infection dynamics in lymph-node networks, originally introduced by Mukwembi. Each vertex represents a cell site that may be healt…

math.CO2025

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…

math.CO2020★ 1 cited

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…

math.CO2018

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…

math.CO2015

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…