top of page

Research

Papers:

19. Pardo, GA., De Loera, J.A., Figueroa, A.P., Gamma-Dessavre, A., Possani, E. (2025). The Computational Challenge of Constructing Cages and (k, g)-Graphs. In: Sriraman, B. (eds) Handbook of Visual, Experimental and Computational Mathematics . Springer, Cham. https://doi.org/10.1007/978-3-030-93954-0_56-1

18. Figueroa, A. P., Montellano-Ballesteros, J. J., & Olsen, M. (2025). Hamiltonian connected balanced multipartite tournaments and hamiltonian connected partitions.  
Australasian Journal of Combinatorics, 91(1), 67-76.

17. Figueroa, A. P., Montellano-Ballesteros, J. J., & Olsen, M. (2023). Partition of regular balanced c-tournaments into strongly connected c-tournaments. Discrete Mathematics, 346(7), 113459.

16. Ábrego, B. M., Fernández-Merchant, S., Figueroa, A. P., Montellano-Ballesteros, J. J., & Rivera-Campo, E. (2022). The Crossing Number of Twisted Graphs. Graphs and Combinatorics, 38(5), 134.

15. Figueroa, A. P.,   Montellano-Ballesteros, J. J., & Olsen, M. (2022).Conditions on the regularity of balanced c-partite tournaments for the existence of strong subtournaments with high minimum degree. Australasian Journal of Combinatorics, 82(3), 353—365.

14. Figueroa, A. P., & Fresán-Figueroa, J. (2020). The biplanar tree graph. Boletín de la Sociedad Matemática Mexicana, 26(3), 795-806.

13. Figueroa, A. P., Possani, E., & Trigueros, M. (2018). Matrix multiplication and transformations: an APOS approach. The Journal of Mathematical Behavior, 52, 77-91.

12. Figueroa, A. P., Hernández-Cruz, C., & Olsen, M. (2017). The minimum feedback arc set problem and the acyclic disconnection for graphs. Discrete Mathematics, 340(7), 1514-1521.

11. Figueroa, A. P., Fresán-Figueroa, J., & Rivera-Campo, E. (2017). On the perfect matching graph defined by a set of cycles. Boletín de la Sociedad Matemática Mexicana, 23, 549-556.

10. Figueroa, A. P., Montellano-Ballesteros, J. J., & Olsen, M. (2016). Strong subtournaments and cycles of multipartite tournaments. Discrete Mathematics, 339(11), 2793-2803.

9. Figueroa, A. P.,  & Rivera-Campo, E. (2015). A counterexample to a result on the tree graph of a graph. Australasian Journal of Combinatorics, 63(3), 368-373.

8. Figueroa, A. P., Olsen, M., & Zuazua, R. (2015). On the vertices of a 3-partite tournament not in triangles. Discrete Mathematics, 338(11), 1982-1988.

7. Figueroa, A. P., Llano, B., Olsen, M., & Rivera-Campo, E. (2012). On the acyclic disconnection of multipartite tournaments. Discrete Applied Mathematics, 160(10-11), 1524-1531.

6. Figueroa, A. P., & Rivera-Campo, E. (2012). The basis graph of a bicolored matroid. Discrete Applied Mathematics, 160(18), 2694-2697.

5. Figueroa, A. P., & Olsen, M. (2012). The tight bound on the number of C_3-free vertices on regular 3-partite tournaments. Australasian Journal of Combinatorics, 52, 209-214.

4. Figueroa, A. P., & Llano, B. (2010). An infinite family of self-diclique digraphs. Applied mathematics letters, 23(5), 630-632.

3. Figueroa, A. P., Llano, B., & Zuazua, R. (2010). The number of C3-free vertices on 3-partite tournaments. Discrete mathematics, 310(19), 2482-2488.

2. Figueroa, A. P. (2009). A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs. Computational Geometry, 42(1), 90-91.

1. Figueroa, A., & Rivera-Campo, E. (2008). On the tree graph of a connected graph. Discussiones Mathematicae Graph Theory, 28(3), 501-510.

Proceedings
1. .Figueroa A. P., Salgado H., & Trigueros M. The skateboard drawing of a System of equations. INDRUM 2024 Proceedings.

bottom of page